Abstract
The current programming paradigm for data-parallel computations is shifting with the rapidly increasing data growth on the web. It gives programmers more challenges than ever before. In this paper we propose Parallel Abstract State Machines (P-ASMs) that can empower programmers, no matter how experienced, by providing a well-founded systems engineering method to model data-parallel computations at arbitrary levels of abstraction. Particularly, we focus on discussing how P-ASMs can capture two classes of data-parallel computations that are most important in practice - ones that are always-consistent and ones that require transactional data consistency.
| Original language | English |
|---|---|
| Title of host publication | Conceptual Modelling and Its Theoretical Foundations |
| Subtitle of host publication | Essays Dedicated to Bernhard Thalheim on the Occasion of His 60th Birthday |
| Publisher | Springer Verlag |
| Pages | 136-150 |
| Number of pages | 15 |
| ISBN (Print) | 9783642282782 |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 7260 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Fingerprint
Dive into the research topics of 'Abstract state machines for data-parallel computing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver