Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 1998

Task Parallelism in Spar

F. Kuijlman, A. Rădulescu, Arjan J. C. van Gemund, Henk Sips

Cited by 0Abstract and details only

Abstract

In this paper we will give a small introduction to Spar, a programming language for semi-automatic parallel programming. Spar, a Java derivative is being developed as part of the Automap project, which aims to create completely automatic mappings for code and data at either compile time or runtime. We will present how Spar supports task-parallel programming and how it interacts with the user or the scheduler to define code mappings. 2 Introduction Issues that are of major importance in the design of parallel programming languages for distributedmemory systems include: ffl parallelizability, the extent to which parallelism can either be expressed by the user or deduced by the compiler such that problem parallelism is adequately captured. ffl programmability, the extent to which the user is relieved from programming the complex synchronizations required between concurrently executing tasks in order to retain correctness. ffl portability, the extent to which the program is machine-inde...

Cite this paper

APA 7

Kuijlman, F., Rădulescu, A., van Gemund, A. J. C., & Sips, H. (1998). Task Parallelism in Spar.

MLA 9

Kuijlman, F., et al. “Task Parallelism in Spar.” 1998.

Chicago

Kuijlman, F., A. Rădulescu, Arjan J. C. van Gemund, and Henk Sips. 1998. “Task Parallelism in Spar.”

Harvard

Kuijlman, F. et al. (1998) ‘Task Parallelism in Spar’.

BibTeX
@article{kuijlman1998task,
  title = {{Task Parallelism in Spar}},
  author = {Kuijlman, F. and Rădulescu, A. and van Gemund, Arjan J. C. and Sips, Henk},
  year = {1998}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers