scientific article; zbMATH DE number 910914

MaRDI QIDQ4886091zbMATH OpenFDO

Authors Nabil Kahalé, Tom Leighton

Publication date 10 November 1996

zbMATH Keywords

dynamic routinggreedy algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Greedy Dynamic Routing on Arrays
• Greedy Packet Scheduling on Shortest Paths
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Bounds on the greedy routing algorithm for array networks
• Greedy Packet Scheduling

Cited in

(6)

• Greedy Dynamic Routing on Arrays
• scientific article; zbMATH DE number 1256752 (Why is no real title available?)
• Stochastic analysis of dynamic processes
• Constant time per edge is optimal on rooted tree networks
• Average-case analysis of greedy packet scheduling (extended abstract)
• Bounds on the greedy routing algorithm for array networks

This page was built for publication:

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