Abstract state machines for data-parallel computing

Qing Wang*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageEnglish
Title of host publicationConceptual Modelling and Its Theoretical Foundations
Subtitle of host publicationEssays Dedicated to Bernhard Thalheim on the Occasion of His 60th Birthday
PublisherSpringer Verlag
Pages136-150
Number of pages15
ISBN (Print)9783642282782
DOIs
Publication statusPublished - 2012
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7260 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