Kalantery, Nasser and Winter, Stephen and Wilson, Derek R. (1995) From BSP to a virtual von Neumann machine. Computing & Control Engineering Journal, 6 (3). pp. 131-136. ISSN 0956-3385Full text not available from this repository.
The BSP (bulk synchronous parallel) architecture incorporates a scalable and transparent communication model. The task-level synchronisation mechanism of the machine, however, is not transparent to the user and can be inefficient when applied to the co-ordination of irregular parallelism. This article presents a discussion of an alternative memory-level scheme which offers the prospect of achieving both efficient and transparent synchronisation. The scheme, based on a discrete-event simulation paradigm, supports a sequential style of programming and, coupled with the BSP communication model, leads to the emergence of a virtual von Neumann parallel computer.
|Subjects:||University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use)|
|Depositing User:||Miss Nina Watts|
|Date Deposited:||20 Sep 2011 11:46|
|Last Modified:||20 Sep 2011 11:46|
Actions (login required)
|Edit Item (Repository staff only)|