Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 14, 2001 | Submitted
Report Open

Parallel Programming Archetypes in Combinatorics and Optimization

Abstract

A Parallel Programming Archetype is a language-independent program design strategy. We describe two archetypes in combinatorics and optimization, their components, implementations, and example applications developed using an archetype.

Additional Information

© 1995 California Institute of Technology. June 12, 1995. Many thanks to Mani Chandy whose guidance and encouragement as my research advisor was very much appreciated. Also I would like to thank the other members of Compositional Systems Research Group - Berna Massingill Adam Rifkin, Eve Schooler, Paul Massingill, Adam Siviloti. John Thornley - for valuable discussions, comments and suggestions. I wish to thank Caltech and Green Hills for supporting my education. Last, but not least, I would like to thank my husband, Anatoly, for his loving support. This research was supported in part by AFOSR grant F49620-94-1-0244 and by the NSF under Cooperative Agreement No. CCR-9120008.

Attached Files

Submitted - 00/95-06.ps

Submitted - 95-06.pdf

Files

95-06.pdf
Files (394.8 kB)
Name Size Download all
md5:77eb19d5733a99bd919775c71aec60d2
394.8 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
January 13, 2024