Approximating the buffer allocation problem using epochs
From MaRDI portal
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)- On the complexity of buffer allocation in message passing systems
- Experimental and Efficient Algorithms
- A buffer minimization problem for the design of embedded systems
- Buffered Resource Constraint: Algorithms and Complexity
- The time buffer approximated buffer allocation problem: a row-column generation approach
- scientific article; zbMATH DE number 2247815 (Why is no real title available?)
- scientific article; zbMATH DE number 220697 (Why is no real title available?)
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)