article · 1996
Multiprogramming BSP Programs
D. B. Skillicorn
Cited by 0Abstract and details only
Abstract
We explore the problem of transforming a BSP program for execution on a multiprogramming architecture, where it has to share resources with other BSP programs executing at the same time. 1 The BSP model The Bulk Synchronous Parallelism (BSP) [2] model is a general-purpose model that is both architecture-independent and efficient for most problems on today's architectures. A BSP program consists of a set of supersteps, each of which consists of: ffl a set of threads, involving local computation on locally-held variables; ffl a global communication in which data is moved between threads; and ffl a barrier synchronisation, which ends the superstep, and defines the moment at which moved data becomes locally visible. BSP does not exploit locality, so programmers may not make any assumptions about how threads will be mapped to processors. In practice, BSP implementations randomise this placement so that the set of messages to be delivered at any moment during the communication phase will ...
Cite this paper
Skillicorn, D. B. (1996). Multiprogramming BSP Programs.
Skillicorn, D. B. “Multiprogramming BSP Programs.” 1996.
Skillicorn, D. B. 1996. “Multiprogramming BSP Programs.”
Skillicorn, D.B. (1996) ‘Multiprogramming BSP Programs’.
@article{skillicorn1996multiprogramming,
title = {{Multiprogramming BSP Programs}},
author = {Skillicorn, D. B.},
year = {1996}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.