This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Koji GODA, Toshinori YAMADA, Shuichi UENO, "A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 4, pp. 1090-1092, April 2005, doi: 10.1093/ietfec/e88-a.4.1090.
Abstract: This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.4.1090/_p
Copy
@ARTICLE{e88-a_4_1090,
author={Koji GODA, Toshinori YAMADA, Shuichi UENO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems},
year={2005},
volume={E88-A},
number={4},
pages={1090-1092},
abstract={This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.},
keywords={},
doi={10.1093/ietfec/e88-a.4.1090},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1090
EP - 1092
AU - Koji GODA
AU - Toshinori YAMADA
AU - Shuichi UENO
PY - 2005
DO - 10.1093/ietfec/e88-a.4.1090
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2005
AB - This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks, and shows some improvements upon previous results on the problem.
ER -