Back to Computing Methods list
Project ID: 1665-AP
Available for licensing
Irregular programs deal with pointer-based data structures like large graphs and trees. It is well known that it is difficult to exploit parallelism in these programs. We have developed a programming model and an associated software system that make it much easier to exploit parallelism in irregular programs on multicore processors.
The programming model provides two constructs called optimistic iterators that programmers use to highlight opportunities for exploiting generalized data-parallelism, a form of parallelism that is ubiquitous in irregular programs. When the program is executed, the associated software system uses speculative parallelism to execute these iterators in parallel. The programming model also permits programmers to specify semantic information about classes in class libraries that is useful for exploiting parallelism.
The class of programs that can benefit from this programming model and associated software system is very large; for example, mesh generators, which are used extensively in finite-element methods and in graphics; many data-mining applications; and many computational biology applications
Lab/bench prototype
One PCT patent application filed
Keshav Pingali, Ph.D., Computer Sciences, The University of Texas at Austin
Milind Kulkarni, Computer Sciences, The University of Texas at Austin
Jitendra Jain, Licensing Specialist
jjain@otc.utexas.edu
512-471-9055
http://portal.acm.org/citation.cfm?id=1250759
Copyright ©2006-2009, Office of Technology Commercialization. All rights reserved.