Distrbuted Processing and List Scheduling on WDM Optical Interconnection Networks using Genetic Algorithms


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 9, pp. 2032-2041, Sep. 1998
10.3745/KIPSTE.1998.5.9.2032,   PDF Download:

Abstract

The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete. It is known that the list scheduling is a good approximation algorithm for this problem. The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot. We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths. Genetic algorithms are used to explore various orders of transmitters.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Jin, W. K. Bum, Y. H. Jin, H. M. Pyo, B. K. June, "Distrbuted Processing and List Scheduling on WDM Optical Interconnection Networks using Genetic Algorithms," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 9, pp. 2032-2041, 1998. DOI: 10.3745/KIPSTE.1998.5.9.2032.

[ACM Style]
Jung Hea Jin, Wee Kyun Bum, Yeh Hong Jin, Hong Man Pyo, and Byeon Kwnag June. 1998. Distrbuted Processing and List Scheduling on WDM Optical Interconnection Networks using Genetic Algorithms. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 9, (1998), 2032-2041. DOI: 10.3745/KIPSTE.1998.5.9.2032.