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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Published: |
College of Education for Pure Sciences,
2005-06-01T00:00:00Z.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Connect to this object online.3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |