Parallel and Distributed Processing Symposium, International (2007)
Long Beach, CA, USA
Mar. 26, 2007 to Mar. 30, 2007
Michel Dubois , University of Southern California, Dept. of Electrical Engineering, Los Angeles, CA 90089-2562, USA. email@example.com
Hyunyoung Lee , University of Denver, Dept. of Computer Science, Denver, CO 80208, USA. firstname.lastname@example.org
Lan Lin , University of Denver, Dept. of Computer Science, Denver, CO 80208, USA. email@example.com
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous Multi-Processing) as a universal performance and power complexity model for multithreaded algorithms and systems. We provide examples to illustrate how to design and analyze algorithms using STAMP and how to apply the complexity estimates to better utilize CMP(Chip MultiProcessor)-based machines within given constraints such as power.
L. Lin, H. Lee and M. Dubois, "STAMP: A Universal Algorithmic Model for Next-Generation Multithreaded Machines and Systems," 2007 IEEE International Parallel and Distributed Processing Symposium(IPDPS), Rome, 2007, pp. 494.