Kryukova, Svetlana A (1995) Parallel Programming Archetypes in Combinatorics and Optimization. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-06
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 350Kb | |
![[img]](http://authors.library.caltech.edu/style/images/fileicons/other.png)
|
Other (Adobe PDF (395KB))
See Usage Policy. 385Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-06
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
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1995.cs-tr-95-06 |
| Persistent URL: | http://resolver.caltech.edu/CaltechCSTR:1995.cs-tr-95-06 |
| 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 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 14 May 2001 |
| Last Modified: | 26 Dec 2012 14:08 |
Repository Staff Only: item control page
