Epochs
| dc.contributor.author | Solworth, Jon A. | en_US |
| dc.date.accessioned | 2007-04-23T17:17:54Z | |
| dc.date.available | 2007-04-23T17:17:54Z | |
| dc.date.issued | 1987-04 | en_US |
| dc.description.abstract | To date, the implementation of message passing languages have required the communications variables (sometimes called ports) either to be limited to the number of physical communications registers in the machine, or to be mapped to memory. Neither solution is satisfactory. Limiting the number of variables decreases modularity and efficiency of parallel programs. Mapping variables to memory increases the cost of communications and the granularity of parallelism. We present here a new programming language construct called epochs. Epochs are a scoping mechanism within which the programmer can declare communications variables, which are live only during the scope of that epoch. To limit the range of time a register has to be allocated for a communications variable, the compiler ensures that all processors enter an epoch simultaneously. The programming style engendered fits somewhere between the SIMD data parallel and MIMD process spawning models. We describe an implementation for epochs including an efficient synchronization mechanism, means of statically binding registers to communications variables and a method of fusing epochs to reduce synchronization overhead. | en_US |
| dc.format.extent | 2207916 bytes | |
| dc.format.extent | 410456 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-807 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6647 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Epochs | en_US |
| dc.type | technical report | en_US |