Process Algebra for Parallel and Distributed Processing

  • Authors:
  • Michael Alexander;William Gardner

  • Affiliations:
  • -;-

  • Venue:
  • Process Algebra for Parallel and Distributed Processing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Exploring state-of-the-art applications, Process Algebra for Parallel and Distributed Processing shows how one formal method of reasoningprocess algebrahas become a powerful tool for solving design and implementation challenges of concurrent systems. Parallel Programming Divided into three parts, the book begins by parallelizing an algorithm for the Cell Broadband Engine processor of Sony, Toshiba, and IBM. It also develops a runtime environment that can be ported to different parallel platforms and describes the formal model of action systems. Distributed Systems The next part presents a process algebra (mCRL2) that targets distributed applications, looks at how to turn prose descriptions into unambiguous specifications, extends pi-calculus to create a service-oriented mobility abstract machine, and introduces the Channel Ambient Machine for mobile applications. Embedded Systems The final section combines state-based Z with the event-based process algebra CSP in a formal methodology called Circus. It also develops a pair of process algebras (PARS) to address the problem of scheduling in real-time embedded systems and emphasizes the reuse of concurrent artifacts across different hardware platforms. Focusing on the contributors own research work, this volume highlights the recent growth in this burgeoning industry. It proposes solutions to the problems of designing and implementing todays multicore processor architectures, clusters, and grids.