On the complexity of buffer allocation in message passing systems

Message passing programs commonly use message buffers to avoid unnecessary synchronizations and to improve performance by overlapping communication with computation. Unfortunately, using buffers can introduce portability problems and can lead to deadlock problems on systems without a sufficient numb...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing Jg. 65; H. 6; S. 692 - 713
Hauptverfasser: Brodsky, Alex, Pedersen, Jan Bækgaard, Wagner, Alan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: San Diego, CA Elsevier Inc 01.06.2005
Elsevier
Schlagworte:
Applied sciences
Buffer allocation
Complexity
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Message passing systems
Parallel and distributed programming
Software
Message passing systems
Parallel and distributed programming
Buffer allocation
Complexity
Deadlock
Parallel programming
Distributed programming
Message passing
Parallelism
Portability
Buffer system
Synchronization
ISSN:0743-7315, 1096-0848
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Message passing programs commonly use message buffers to avoid unnecessary synchronizations and to improve performance by overlapping communication with computation. Unfortunately, using buffers can introduce portability problems and can lead to deadlock problems on systems without a sufficient number of message buffers. We explore a variety of problems related to buffer allocation for safe and efficient execution of message passing programs. We show that determining the minimum number of message buffers or verifying that each process has a sufficient number of message buffers are intractable problems. However, we give a polynomial time algorithm to determine the minimum number of message buffers needed to ensure that no send operation is unnecessarily delayed due to lack of message buffers. We extend these results to several different buffering schemes, which in some cases make the problems tractable.
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2004.10.009