Achieving realtime capabilities in ethernet networks by edge-coloring of communication conflict-multigraphs

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 24th IASTED International Multi-Conference on APPLIED INFORMATICS

Volumn 2006, Issue , 2006, Pages 180-185

  Dopatka, Frank ^a   Wismüller, Roland ^a  

^a UNIVERSITY OF SIEGEN   (Germany)

Author keywords

Graph coloring; Greedy; Industrial automation; QoS

Indexed keywords

AUTOMATION; COLOR COMPUTER GRAPHICS; PACKET NETWORKS; QUALITY OF SERVICE; SORTING; SWITCHING NETWORKS;

EDGE COLORING; EDGE PRESORTING; GRAPH COLORING; INDUSTRIAL AUTOMATION;

ETHERNET;

EID: 33845587912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. G. Schnell, Bussysteme in der Automatisierungs- und Prozesstechnik (5th revised and extended edition, Braunschweig, Vieweg, 2003, ISBN 3-528-46569-7).
2. D. Tschimpke, Dezentrale Prozess-Automatisierung und vertikale Integration - In die Zukunft mit Plug & Play, elektro Automation 4/2001,2001, 74-75
3. 〈http://standards.ieee.org/getieee802/802.3.htm〉
4. 〈http://www.iaona.ch/〉
5. 〈http://www.ethernet-powerlink.com/〉
6. 〈http://www.profibus.com/profinet.html〉
7. 〈http://www.ethercat.org/〉
8. 〈http://ieee1588.nist.gov/〉
9. M. Valerie, L. E. Moser, P. M. Melliar-Smith, Avoiding memory contention on tightly coupled multiprocessors. Proc. 1st International Conference on Massively Parallel Computing Systems, Ischia, Italy, 1994, 643-654, ISBN: 0-8186-6322-7
10. D. Marx, Graph Coloring Problems and their Applications in Scheduling, John von Neumann PhD students Conference, Budapest University of Technology and Economics, 2003
11. I. Holyer, The NP-completeness of edge-coloring, SIAM Journal on Computing 10(4), Philadelphia, PA, 1981, 718-720
12. T. Emden-Weinert et al., Einführung in Graphen und Algorithmen, lecture notes, Humboldt University of Berlin, 1996, 〈http://www.informatik.hu-berlin.de/Institut/struktur/algorithmen/ga/〉
13. S. Davis, R. Impagliazzo, Models of greedy Algorithms for Graph Problems. Proc. 5th ACM-SIAM symposium on Discrete algorithms, New Orleans, Louisiana, 2004, 381-390, ISBN 0-89871-558-X
14. D. W. Matula, L. L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, Journal of the Association for Computing Machinery 30(3), 1983, 417-427
15. D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM 22(4), 1979, 251-256, ISSN 0001-0782