scientific article; zbMATH DE number 1256754

zbMATH Open0936.68010MaRDI QIDQ4228490FDOQ4228490

Éva Tardos, Yuval Rabani

Publication date: 18 May 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

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

Cited In (15)

• Communication in parallel systems
• Stackelberg Routing in Arbitrary Networks
• Bounding Residence Times for Atomic Dynamic Routings
• Scheduling nonuniform traffic in a packet switching system with large propagation delay
• Atomic routing games on maximum congestion
• Direct routing: Algorithms and complexity
• Task swapping networks in distributed systems
• Scheduling problems in transportation networks of line topology
• On the benefit of supporting virtual channels in wormhole routers
• Universal Packet Routing with Arbitrary Bandwidths and Transit Times
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
• Packet task processing in distributed computational environments with inalienable resources
• Adaptive packet routing for bursty adversarial traffic
• Online packet-routing in grids with bounded buffers
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules

   Recommendations

• Title not available (Why is that?) 👍 👎
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps 👍 👎
• General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate) 👍 👎

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 Q4228490)