Graphs and algorithms
A bridging model for parallel computation
Communications of the ACM
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
A calculus of mobile processes, I
Information and Computation
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
Communication and concurrency
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
BSPlib: The BSP programming library
Parallel Computing
A calculus of functional BSP programs
Science of Computer Programming - Special issue on mathematics of program construction
Handbook of Theoretical Computer Science: Formal Models and Semantics
Handbook of Theoretical Computer Science: Formal Models and Semantics
MPI: The Complete Reference
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Combinators and bisimulation proofs for restartable systems
Combinators and bisimulation proofs for restartable systems
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Parallel superposition for bulk synchronous parallel ML
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Using admissible interference to detect denial of service vulnerabilities
IWFM'03 Proceedings of the 6th international conference on Formal Methods
OSL: Optimized Bulk Synchronous Parallel Skeletons on Distributed Arrays
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
| Hi-index | 0.00 |
The calculus of communicating systems (CCS) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness in protocols or distributed programs. In more recent work, it is used for the analysis of security properties. Bulk-synchronous parallelism (BSP) is an algorithm and programming model of data-parallel computation. It is useful for the design, analysis and programming of scalable parallel algorithms. Many current evolutions require the integration of distributed and parallel programming: grid systems for sharing resources across the Internet, secure and reliable global access to parallel computer systems, geographic distribution of confidential data on randomly accessible systems, etc. Such software services must provide guarantees of safety, liveness, security together with scalable and reliable performance. Formal models are therefore needed to combine parallel performance and concurrent behavior. With this goal in mind, we propose here an integration of BSP with CCS semantics, generalize its cost (performance) model and sketch its application to scheduling problems in meta-computing.