Citation
Kryukova, Svetlana A. (1995) Parallel Programming Archetypes in Combinatorics and Optimization. Master's thesis, California Institute of Technology. doi:10.7907/g8mm-x344. https://resolver.caltech.edu/CaltechTHESIS:04112012-083734292
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: | Thesis (Master's thesis) |
|---|---|
| Subject Keywords: | Computer Science |
| Degree Grantor: | California Institute of Technology |
| Division: | Engineering and Applied Science |
| Major Option: | Computer Science |
| Thesis Availability: | Public (worldwide access) |
| Research Advisor(s): |
|
| Thesis Committee: |
|
| Defense Date: | 12 June 1995 |
| Record Number: | CaltechTHESIS:04112012-083734292 |
| Persistent URL: | https://resolver.caltech.edu/CaltechTHESIS:04112012-083734292 |
| DOI: | 10.7907/g8mm-x344 |
| Default Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 6903 |
| Collection: | CaltechTHESIS |
| Deposited By: | Benjamin Perez |
| Deposited On: | 11 Apr 2012 16:41 |
| Last Modified: | 09 Nov 2022 19:19 |
Thesis Files
![[img]](/style/images/fileicons/application_pdf.png)
|
PDF
- Final Version
See Usage Policy. 394kB |
Repository Staff Only: item control page
