๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamic Schedule for Effective On-Line Connection Pruning

โœ Scribed by Santiago Rementeria

Book ID
110299921
Publisher
Springer US
Year
2001
Tongue
English
Weight
141 KB
Volume
14
Category
Article
ISSN
1370-4621

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Pruned optical banyan networks on vertic
Pruned optical banyan networks on vertical stacking scheme for faster connection establishment
โœ Md. Mamun-ur-Rashid Khandker; Xiaohong Jiang; Masaru Fukushi; Susumu Horiguchi ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

In this paper, we address the issue of faster connection establishment in a large vertically stacked optical Banyan (VSOB) network. The best known global routing algorithm, which turns an N โ€ข N crosstalk-free VSOB network into a rearrangeably non-blocking one, has time complexity O (NlogN). This is

On an on-line scheduling problem for par
On an on-line scheduling problem for parallel jobs
โœ Edwin Naroska; Uwe Schwiegelshohn ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 101 KB

This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 -1 m