- Title
- Parallel process placement
- Creator
- Handler, Caroline
- Subject
- Parallel programming (Computer science)
- Date Issued
- 1989
- Date
- 1989
- Type
- Thesis
- Type
- Masters
- Type
- MSc
- Identifier
- vital:4568
- Identifier
- http://hdl.handle.net/10962/d1002033
- Description
- This thesis investigates methods of automatic allocation of processes to available processors in a given network configuration. The research described covers the investigation of various algorithms for optimal process allocation. Among those researched were an algorithm which used a branch and bound technique, an algorithm based on graph theory, and an heuristic algorithm involving cluster analysis. These have been implemented and tested in conjunction with the gathering of performance statistics during program execution, for use in improving subsequent allocations. The system has been implemented on a network of loosely-coupled microcomputers using multi-port serial communication links to simulate a transputer network. The concurrent programming language occam has been implemented, replacing the explicit process allocation constructs with an automatic placement algorithm. This enables the source code to be completely separated from hardware considerations
- Format
- 54 leaves
- Format
- Publisher
- Rhodes University
- Publisher
- Faculty of Science, Computer Science
- Language
- English
- Rights
- Handler, Caroline
- Hits: 586
- Visitors: 694
- Downloads: 129
Collections
RU Department of Computer Science
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCEPDF | 6 MB | Adobe Acrobat PDF | View Details Download |