A comparative study of two algorithms of multi - processor scheduling
This study tackles the processes scheduling problem of multiprocessor and describing two algorithms from many algorithms for an array of dependent processes, which are represented by, direct a cj'clic<br /> Graph on different forms correlation among the processes and tries to determine th...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Kitap |
| Baskı/Yayın Bilgisi: |
College of Education for Pure Sciences,
2005-06-01T00:00:00Z.
|
| Konular: | |
| Online Erişim: | Connect to this object online. |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Internet
Connect to this object online.3rd Floor Main Library
| Yer Numarası: |
A1234.567 |
|---|---|
| Kopya Bilgisi 1 | Kütüphanede |