Loading...
Please wait, while we are loading the content...
Real-Time Tasks and Resourcesto Distributed Systems Too-Seng
| Content Provider | Semantic Scholar |
|---|---|
| Author | W.-S, Jane Department, Liu |
| Copyright Year | 1995 |
| Abstract | In this paper, we study 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 schedule 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 eecient heuristic algorithm, which is based on clustering and graph-bisection, to nd an assignment. Experimental results indicate that the assignment algorithm is eeective. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-rtsl.cs.uiuc.edu/papers/TiLi94a.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
