Bounds on the Performance of Work-greedy Assignment Schemes
| dc.creator | Manoharan,Sathiamoorthy | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:49:01Z | |
| dc.date.available | 2024-02-06T12:49:01Z | |
| dc.description | The heuristics most of the current assignment schemes use is based on satisfying the following rule of thumb: keeping the processors busy leads to a 'good' assignment. Such schemes are said to be work-greedy. This paper presents new bound s on the performance of work-greedy schemes, taking into account the degree of parall elism visible between the tasks and the inter-task communication delays. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-07-0803 | |
| dc.identifier | https://lib.jucs.org/article/27381/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7195 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(7): 803-812 | |
| dc.subject | Allocation | |
| dc.subject | Dependency graphs | |
| dc.subject | Instruction-level parallelism | |
| dc.subject | Scheduling | |
| dc.subject | Processor assignment. | |
| dc.title | Bounds on the Performance of Work-greedy Assignment Schemes | |
| dc.type | Research Article |