Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Towards Formally Refining BSP Barriers into Explicit TwoSided Communications

Alan Stewart6, Maurice Clint6, Joquim Gabarró7 and Maria J. Serna7

(6)  School of Computer Science, The Queen’s University of Belfast, N. Ireland
(7)  Dep. LSI, Universitat Politècnica de Catalunya, Barcelona, Spain
Abstract
An experiment is conducted to assess the feasibility of transforming BSP computations into systems employing explicit asynchronous two — sided communications. The aim of the work is to show how a verified BSP program may be transformed into a guaranteed correct conventional message-passing implementation which may, in certain circumstances, avoid the expense of providing a synchronisation barrier.
Partially supported by (i) The British Council and Spanish Ministry of Education ACI HB1999-0093, (ii) Spanish CICYT under grants TIC1999-0754-C03-02 (Mallba) & TIC2000-1970-CE and (iii) the IST programme of EU under contract number IST-1999-14186 (ALCOM-FT).

Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.109 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)