English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

can nheone give an algorithm for k-processor scheduling or n-processor scheduling.

if pssible also the time complexity...andsome sites which may help me.

2006-10-05 22:24:29 · 1 answers · asked by anish 1 in Education & Reference Special Education

1 answers

It would help is you spelled, "processor" correctly.

This should help though, "The Complexity of Scheduling Graphs of Bounded Width Subject to Non-Zero Communication Delays (1997)"

More at:

2006-10-09 17:15:24 · answer #1 · answered by Teacher Man 6 · 0 0

fedest.com, questions and answers