Abstract
The provision of mechanisms for processor allocation in current distributed parallel programming models is very limited. This makes difficult, or even prohibits, the expression of a large class of programs which require a run-time assessment of their required resources. This includes programs whose structure is irregular, composite or unbounded. Efficient allocation of processors requires a process creation mechanism able to initiate and terminate remote computations quickly. This paper presents the design, demonstration and analysis of an explicit mechanism to do this, implemented on the XMOS XS1 architecture, as a foundation for a more dynamic scheme. It shows that process creation can be made efficient so that it incurs only a fractional overhead of the total runtime and that it can be combined naturally with recursion to enable rapid distribution of computations over a system.
Translated title of the contribution | Fast Distributed Process Creation with the XMOS XS1 Architecture |
---|---|
Original language | English |
Title of host publication | Communicating Process Architectures 2011 |
Subtitle of host publication | Proceedings of the 33rd Communicating Process Architecture (CPA) conference, held at the University of Limerick, Ireland, 19-22 June, 2011 |
Publisher | IOS Press |
Pages | 195 - 207 |
Number of pages | 13 |
ISBN (Electronic) | 9781607507741 |
ISBN (Print) | 9781607507734 |
DOIs | |
Publication status | Published - Jun 2011 |
Publication series
Name | Concurrent Systems Engineering Series |
---|---|
Volume | 68 |
ISSN (Print) | 1383-7575 |
Bibliographical note
Editors: P.H. Welch, A.T. Sampson, J.B. Pedersen, J. Kerridge, J.F. Broenink and F.R.M. BarnesISBN: 9781607507734
Publisher: IOS Press
Name and Venue of Conference: Communicating Process Architectures
Name and Venue of Event: Communicating Process Architectures 2011, University of Limerick, Ireland
Conference Organiser: WoTUG