Towards formally refining BSP barriers into explicit two-sided communications

DOI10.1007/3-540-44681-8_79MaRDI QIDQ4791950zbMATH OpenFDO

Authors A. Stewart, M. Clint, Joaquim Gabarró, Maria Serna

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500549

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• Synchronising asynchronous communications
• AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
• Barrier synchronisation: Axiomatisation and relaxation
• Communication primitives for BSP computers
• BSP versus LogP

This page was built for publication: Towards formally refining BSP barriers into explicit two-sided communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791950)