"Automatic Parallelizing of Irregular Applications for Multicore Processors" This proposal describes a new approach for parallelizing and optimizing irregular programs for multicore processors. The focus is on two important irregular data structures, graphs and trees, and two important application areas, mesh generation and graphics, that use these data structures extensively. We propose to investigate the use of transactional memory for optimistic parallelization, and scheduling techniques for parallel performance. The proposal advocates the use of a programming methodology in which the algorithm is separated from the data structure. This approach will exploit high-level abstractions to promote parallel execution.