Approximating the buffer allocation problem using epochs

DOI10.1016/J.JPDC.2008.06.001MaRDI QIDQ436884zbMATH OpenOpenAlexFDO

Authors Jan Pedersen, Alex Brodsky, Jeffrey Sampson

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

buffer allocationcomplexitymessage passing systemsparallel and distributed programming

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of buffer allocation in message passing systems
• Deadlock free buffer allocation in closed queueing networks
• Optimal centralized algorithms for store-and-forward deadlock avoidance
• Requirements for Deadlock-Free, Adaptive Packet Routing
• Efficient algorithms for buffer space allocation

Cites work

• scientific article; zbMATH DE number 107927 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• Introduction to algorithms.
• On the complexity of buffer allocation in message passing systems
• Optimal buffer allocation in finite closed networks with multiple servers
• Optimization aspects of deadlock prevention in packet-switching networks
• Reachability trees for high-level Petri nets
• Repeatable and portable message-passing programs
• The optimal buffer allocation problem
• Time, clocks, and the ordering of events in a distributed system

Cited in

(7)

• A buffer minimization problem for the design of embedded systems
• The time buffer approximated buffer allocation problem: a row-column generation approach
• scientific article; zbMATH DE number 220697 (Why is no real title available?)
• Buffered Resource Constraint: Algorithms and Complexity
• On the complexity of buffer allocation in message passing systems
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 2247815 (Why is no real title available?)

Describes a project that uses

Uses Software

• MPI/MPICH
• LAM-MPI
• MPI

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436884)