The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Switching networks are the core of many communication and multiprocessor systems. In these systems, a set of entities (communication equipment or processors) communicate through the switching network by exchanging messages. Simultaneous transmission or reception of two or more different messages through an input or output port results in the corruption of the messages (also called collision), which are useless and must be retransmitted later. This causes a performance degradation. Collisions can be avoided only by a proper scheduling of the messages. The same problem also arises in single-hop purely optical WDM systems, where simultaneous reception or transmission over the same wavelength channel results in a collision. In this paper, we study the problem of minimum length scheduling of a set of messages subject to precedence constraints. We show that the decision version of the problem is NP-complete even in very restricted cases. This means that the optimization problem cannot be solved in polynomial time, unless P=NP. Since the problem cannot be optimally solved by fast algorithms, we then investigate the existence of polynomial time approximation algorithms, by first proving that approximation algorithms cannot exist with performance ratio bounded by <tmath>$4/3$</tmath> or smaller and successively presenting an <tmath>$\epsilon$</tmath>-approximation algorithm with <tmath>$\epsilon <2$</tmath> for the case of two precedence classes of messages. Finally, we assess the existence of an asymptotically optimal schedule in the general case of an unrestricted number of precedence classes.</p>
Single hop distributed systems, scheduling, NP-completeness, minimum schedule length, approximation algorithms.
Maurizio A. Bonuccelli, Piera Barcaccia, Miriam Di Ianni, "Complexity of Minimum Length Scheduling for Precedence Constrained Messages in Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 1090-1102, October 2000, doi:10.1109/71.888647
94 ms
(Ver 3.3 (11022016))