Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Randomized scheduling algorithm for input-queued switches

From MaRDI portal
Publication:5486906
Jump to:navigation, search

zbMATH Open1112.68502MaRDI QIDQ5486906FDOQ5486906


Authors: Jun Wu, Junzhou Luo Edit this on Wikidata


Publication date: 15 September 2006





Recommendations

  • Randomized scheduling algorithm for queueing networks
  • scientific article; zbMATH DE number 2165697
  • Scheduling of an input-queued switch to achieve maximal throughput
  • Optimum Scheduling and Memory Management in Input Queued Switches With Finite Buffer Space
  • Randomization Does Not Reduce the Average Delay in Parallel Packet Switches


zbMATH Keywords

switches


Mathematics Subject Classification ID

Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)



Cited In (2)

  • A universal randomized packet scheduling algorithm
  • Title not available (Why is that?)





This page was built for publication: Randomized scheduling algorithm for input-queued switches

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5486906&oldid=30039054"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:02. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki