Approximating the buffer allocation problem using epochs

The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages—such applications may deadlock when executed on a system with an insufficient number of messag...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 68; no. 9; pp. 1263 - 1282
Main Authors:	Pedersen, Jan Bækgaard, Brodsky, Alex, Sampson, Jeffrey
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 01.09.2008 Elsevier
Subjects:	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 Message passing systems;Buffer allocation;Complexity;Parallel and distributed programming Message passing Optimal solution Buffer memory Distributed system Buffer system Synchronization Distributed computing Polynomial time
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!