Loading...
Please wait, while we are loading the content...
Similar Documents
Assigning real-timle tasks and resources to distributed systems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tia, Too-Seng |
| Copyright Year | 1995 |
| Abstract | This paper considers the problem of simultaneously assigning real-time tasks and resources to a distributed system, taking into account the execution, communication, and resource-contention costs. We assume that multiprocessor priority-ceiling protocol is used to synchronize the access to shared resources, and each processor schedules the tasks assigned to it using the rate-monotonic scheduling algorithm. The assignment is subject to the constraint that the tasks are schedulable after the assignment. This problem is known to be computationally intractable. We formulate the problem using an assignment graph and describe an efficient heuristic algorithm, which is based on clustering and graph bisection, to find an assignment. Experimental results indicate that the assignment algorithm is effective |
| Starting Page | 18 |
| Ending Page | 25 |
| Page Count | 8 |
| File Format | PDF HTM / HTML |
| Volume Number | 17 |
| Alternate Webpage(s) | http://www-rtsl.cs.uiuc.edu/papers/TiLi94a.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
