Using Simple Abstraction to Guide the Reinvention of Computing for Parallelism
dc.contributor.author | Vishkin, Uzi | |
dc.date.accessioned | 2009-02-10T13:39:00Z | |
dc.date.available | 2009-02-10T13:39:00Z | |
dc.date.issued | 2009-02-06 | |
dc.description.abstract | The sudden shift from single-processor computer systems to many-processor parallel computing systems requires reinventing much of Computer Science (CS): how to actually build and program the new parallel systems. CS urgently requires convergence to a robust parallel general-purpose platform that provides good performance and is easy to program. Unfortunately, this same objective has eluded decades of parallel computing research. Now, continued delays and uncertainty could start affecting important sectors of the economy. This paper advocates a minimalist stepping-stone: settle first on a simple abstraction that encapsulates the new interface between programmers, on one hand, and system builders, on the other hand. This paper also makes several concrete suggestions: (i) the Immediate Concurrent Execution (ICE) abstraction as a candidate for the new abstraction, and (ii) the Explicit Multi-Threaded (XMT) general-purpose parallel platform, under development at the University of Maryland, as a possible embodiment of ICE. ICE and XMT build on a formidable body of knowledge, known as PRAM (for parallel random-access machine, or model) algorithmics, and a latent, though not widespread, familiarity with it. Ease-of-programming, strong speedups and other attractive properties of the approach suggest that we may be much better prepared for the challenges ahead than many realize. | en |
dc.description.sponsorship | National Science Foundation | en |
dc.format.extent | 4469448 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/8933 | |
dc.language.iso | en_US | en |
dc.relation.isAvailableAt | College of Computer, Mathematical & Physical Sciences | en_us |
dc.relation.isAvailableAt | Computer Science | en_us |
dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
dc.subject | parallel computing | en |
dc.subject | parallel algorithms | en |
dc.subject | abstraction | en |
dc.title | Using Simple Abstraction to Guide the Reinvention of Computing for Parallelism | en |
dc.type | Technical Report | en |
Files
Original bundle
1 - 1 of 1