Name
Title | ||
|---|---|---|
Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract) |
Abstract | ||
|---|---|---|
In a multiprocessor system, collisions occur because of simultaneous transmissions or receptions of two or more messages through the same port: messages are corrupted and must be retransmitted. Collisions can be avoided only by a proper scheduling of the messages. In this paper, minimum length schedulings of a set of communication requests subject to precedence constraints are studied. In particular, we first prove some complexity results and then we present some fast heuristics, assessing their average performance by means of computer simulation. The experimental results show that the heuristics perform quite well, and their expected values are very close to the average optimum. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BFb0024753 | Euro-Par, Vol. II |
Keywords | Field | DocType |
extended abstract,precedence constrained messages,minimum length scheduling,distributed system,computer simulation,expected value | Scheduling (computing),Computer science,Parallel computing,Precedence diagram method,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-61627-6 | 3 | 0.39 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Piera Barcaccia | 1 | 10 | 1.14 |
| Maurizio A. Bonuccelli | 2 | 373 | 48.31 |
| Miriam di Ianni | 3 | 144 | 17.27 |