Approximating the buffer allocation problem using epochs

DOI10.1016/J.JPDC.2008.06.001zbMath1243.68072OpenAlexW2079334918MaRDI QIDQ436884

Alex Brodsky, Jeffrey Sampson, Jan Bækgaard Pedersen

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.06.001

zbMATH Keywords

complexitybuffer allocationmessage passing systemsparallel and distributed programming

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Uses Software

• LAM-MPI
• MPI/MPICH
• MPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of buffer allocation in message passing systems
• Reachability trees for high-level Petri nets
• Optimization aspects of deadlock prevention in packet-switching networks
• Optimal buffer allocation in finite closed networks with multiple servers
• Time, clocks, and the ordering of events in a distributed system
• The optimal buffer allocation problem
• Repeatable and portable message-passing programs

This page was built for publication: Approximating the buffer allocation problem using epochs