✦ LIBER ✦

CS-POSA: A High Performance Scheduling Algorithm for WDM Star Networks

✍ Scribed by P. G. Sarigiannidis; G. I. Papadimitriou; A. S. Pomportsis

Publisher: Springer
Year: 2006
Tongue: English
Weight: 324 KB
Volume: 11
Category: Article
ISSN: 1387-974X
DOI: 10.1007/s11107-005-6024-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Intelligent Global Message Prioritiza

An Intelligent Global Message Prioritization Algorithm for High-Performance Scheduling in WDM Star Networks

✍ P. A. Tsimoulas; G. I. Papadimitriou; A. S. Pomportsis 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 503 KB

A high-performance message prioritizatio

A high-performance message prioritization and scheduling protocol for WDM star networks

✍ Paraskevas A. Tsimoulas; G. I. Papadimitriou; Andreas S. Pomportsis 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 588 KB

A performance comparison between graph a

A performance comparison between graph and hypergraph topologies for passive star WDM lightwave networks

✍ H. Bourdin; A. Ferreira; K. Marcus 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Wavelength division multiplexing WDM allows the huge bandwidth of optical fiber to be divided into several high-speed channels in optical passive star based networks. For such processor networks, most of the proposed architectures for interconnecting nodes are based on graph topologies. Recently, to

A high performance, low complexity algor

A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

✍ T. Hagras; J. Janeček 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 413 KB

R-Kleene: A High-Performance Divide-and-

R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks

✍ Paolo D'Alberto; Alexandru Nicolau 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 195 KB