The PARTY parallel runtime systemIn the present automated system for the organization of the data and computational operations entailed by parallel problems, in ways that optimize multiprocessor performance, general heuristics for partitioning program data and control are implemented by capturing and manipulating representations of a computation at run time. These heuristics are directed toward the dynamic identification and allocation of concurrent work in computations with irregular computational patterns. An optimized static-workload partitioning is computed for such repetitive-computation pattern problems as the iterative ones employed in scientific computation.
Document ID
19890064877
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Saltz, J. H. (Yale Univ. New Haven, CT, United States)
Mirchandaney, Ravi (Yale Univ. New Haven, CT, United States)
Smith, R. M. (Yale Univ. New Haven, CT, United States)
Crowley, Kay (Yale University New Haven, CT, United States)
Nicol, D. M. (College of William and Mary Williamsburg, VA, United States)
Date Acquired
August 14, 2013
Publication Date
January 1, 1989
Subject Category
Computer Systems
Meeting Information
Meeting: SIAM Conference on Parrallel Processing for Scientific Computing
Location: Los Angeles, CA
Country: United States
Start Date: December 1, 1987
End Date: December 4, 1987
Sponsors: Society for Industrial and Applied Mathemetics