On bufferless routing of variable length messages in leveled networks

DOI10.1109/12.506427MaRDI QIDQ4420985zbMATHOpenAlexFDO

Authors Sandeep Bhatt, Gianfranco Bilardi, Geppino Pucci, Arnold L. Rosenberg, Eric J. Schwabe, Abhiram Ranade

Publication date 2 November 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fe2ec17f1f02a4130231e2aac6e923469a47c2bb

zbMATH Keywords

processor networksinterprocessor communicationvirtual chatting schedule

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Scheduling time-constrained communication in linear networks
• Efficient bufferless packet switching on trees and leveled networks
• Approximation and Online Algorithms
• Packet Routing on grids of processors
• Simple algorithms for multimessage multicasting with forwarding

Cited in

(3)

• Data transmission in processor networks
• Scattering and multi-scattering in trees and meshes, with local routing and without buffering
• Methods and problems of communication in usual networks

This page was built for publication: On bufferless routing of variable length messages in leveled networks

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