论文信息 - BSP in CSP: Easy as ABC

BSP in CSP: Easy as ABC

In this paper we describe how the language of Communicating Sequential Processes (CSP) has been applied to the analysis of a transport layer protocol used in the implementation of the Bulk Synchronous Parallel model (BSP). The protocol is suited to the bulk transfer of data between a group of processes that communicate over an unreliable medium with fixed buffer capacities on both sender and receiver. This protocol is modelled using CSP, and verified using the refinement checker FDR2. This verification has been used to establish that the protocol is free from the potential for both deadlock and livelock, and also that it is fault-tolerant.

[1] W. F. McColl,et al. Bulk synchronous parallel computing , 1995 .

[2] Andrew C. Simpson,et al. Safety through security , 1998, Proceedings Ninth International Workshop on Software Specification and Design.

[3] Andrew William Roscoe,et al. The Theory and Practice of Concurrency , 1997 .

[4] Torsten Suel,et al. BSPlib: The BSP programming library , 1998, Parallel Comput..

[5] David B. Skillicorn,et al. Questions and Answers about BSP , 1997, Sci. Program..

[6] David B. Skillicorn,et al. Performance Results for a Reliable Low-Latency Cluster Communication Protocol , 1999, IPPS/SPDP Workshops.

[7] Andrew William Roscoe,et al. Model-checking CSP , 1994 .

[8] David B. Skillicorn,et al. BSP clusters: High performance, reliable and very low cost , 2000, Parallel Comput..

[9] Message Passing Interface Forum. MPI: A message - passing interface standard , 1994 .

[10] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.

[11] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[12] A. W. Roscoe,et al. An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.