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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of parallel and distributed computing Ročník 68; číslo 9; s. 1263 - 1282
Hlavní autori:	Pedersen, Jan Bækgaard, Brodsky, Alex, Sampson, Jeffrey
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier Inc 01.09.2008 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!