Pointer And Escape Analysis Presents a pointer and escape analysis for cilk programs with structured,cobegin/coend multithreading. The algorithm analyzes interactions between threads http://cag.csail.mit.edu/~rinard/paper/pointerAndEscapeAnalysis.html
Extractions: Presents a new pointer and escape analysis. Instead of analyzing the whole program, the algorithm incrementally analyzes only those parts of the program that may deliver useful results. An analysis policy monitors the analysis results to direct the incremental investment of analysis resources to those parts of the program that offer the highest expected optimization return. The experimental results show that almost all of the objects are allocated at a small number of allocation sites and that an incremental analysis of a small region of the program surrounding each site can deliver almost all of the benefit of a whole-program analysis. The policy is usually able to deliver this benefit at a fraction of the whole-program analysis cost. Pointer and Escape Analysis for Multithreaded Programs
Melissa O'Neill: Research Under Cotton, parallel programs are written in a style similar to cilk s parallelextensions to C, but do not require a special translator. http://www.cs.hmc.edu/~oneill/research/
Extractions: If this page looks abnormally plain, you should consider upgrading to a standards-compliant browser Links to other sections of this site appear at the bottom of the page. I am particularly interested in topics in the systems area of computer science, specifically parallel and distributed systems and programming languages . My research focuses on techniques to make programming easier and more reliable, although sometimes I have obtained results in areas tangential to my main interests. You may also want to check out the Clinic projects I've been involved in. In the coming year, I'm hoping to increase my level of student involvement in my research. Currently I have project ideas for students in the area of storage management. I'm also very interested in supporting other student ideas for research that match my interests. This summer, I'm hoping to submit work in the following areas Dominance drawings have some useful properties. In particular, they allow one to determine whether there is a path between two nodes in a graph in O(1) time. Previous algorithms for constructing dominance drawings have assumed that the graph is known when the drawing is made. I have developed a simple algorithm for creating a dominance drawing incrementally. My current work focuses on proving that this simple algorithm is correct.
OpenMP cilk. The WorkQueuing Model. cilk manual A Typechecking Preprocessor for cilk2, a Multithreaded C Language cilk manual Portable HP programs M. Frigo http://nereida.deioc.ull.es/html/openmpindex.html
