A Caltech Library Service

Parallel Programming Archetypes in Combinatorics and Optimization

Kryukova, Svetlana A. (1995) Parallel Programming Archetypes in Combinatorics and Optimization. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished)

PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
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.
Group:Computer Science Technical Reports
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)F49620-94-1-0244
Series Name:Computer Science Technical Reports
Record Number:CaltechCSTR:1995.cs-tr-95-06
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26880
Deposited By: Imported from CaltechCSTR
Deposited On:14 May 2001
Last Modified:03 Oct 2019 03:18

Repository Staff Only: item control page