Liquid Schedule Construction Algorithm : an Efficient Method for Coloring a Congestion Graph

Table of contents Liquid Schedule Construction Algorithm: an Efficient Congestion Graph Coloring Method ................................................................................................................................ 1 Table of contents................................................................................................................. 1

[1]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[2]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[3]  Mahmoud Naghshineh,et al.  Fixed versus variable packet sizes in fast packet-switched networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[4]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[5]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[6]  Kang G. Shin,et al.  Analysis and Implementation of Hybrid Switching , 1995, IEEE Trans. Computers.

[7]  Robert W. Horst.  TNet: A Reliable System Area Network , 1995, IEEE Micro.

[8]  Wentong Cai,et al.  How network topology affects dynamic loading balancing , 1996, IEEE Parallel Distributed Technol. Syst. Appl..

[9]  F. A. Mohammed,et al.  Performance analysis of a cut-through vs. packet-switching techniques , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[10]  Jeffrey S. Chase,et al.  Cut-through delivery in Trapeze: An exercise in low-latency messaging , 1997, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[11]  P. Cameron.  Naïve set theory , 1998 .

[12]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1998, TNET.

[13]  Pierre Kuonen,et al.  Parallel Computer Architectures for Commodity Computing , 1999 .

[14]  Bruno Ciciani,et al.  Performance Analysis of Wormhole Switching with Adaptive Routing in a Two-Dimensional Torus , 1999, Euro-Par.

[15]  Pierre Kuonen,et al.  The K-Ring: a versatile model for the design of MIMD computer topology , 1999 .

[16]  Jonathan S. Turner,et al.  Terabit burst switching , 1999, J. High Speed Networks.

[17]  QiaoChunming,et al.  Optical burst switching (OBS) - a new paradigm for an optical Internet , 1999 .

[18]  Thomas E. Stern,et al.  Multiwavelength Optical Networks: A Layered Approach , 1999 .

[19]  Stéphane Pérennes,et al.  Efficient collective communication in optical networks , 1996, Theor. Comput. Sci..

[20]  Chansup Byun,et al.  A Comparison of Job Management Systems in Supporting HPC ClusterTools , 2000 .

[21]  Yi-Fang Lin,et al.  A simple incremental network topology for wormhole switch-based networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[22]  Ralf Gruber,et al.  Commodity computing results from the Swiss-Tx project , 2001 .

[23]  Shueng-Han Gary Chan,et al.  Operation and cost optimization of a distributed servers architecture for on-demand video services , 2001, IEEE Communications Letters.

[24]  Antonio Robles,et al.  A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment , 2001, J. Parallel Distributed Comput..

[25]  Fabrizio Petrini,et al.  Performance Evaluation of the Quadrics Interconnection Network , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[26]  Ioannis Caragiannis,et al.  Wavelength Routing in All-Optical Tree Networks: A Survey , 2001, Bull. EATCS.

[27]  Ralf Gruber,et al.  Application dedicated clustering , 2002 .

[28]  Sarangapani Jagannathan,et al.  Adaptive admission control of multimedia traffic in high-speed networks , 2002, Proceedings of the IEEE Internatinal Symposium on Intelligent Control.

[29]  Michel Mandjes,et al.  Simple models of network access, with applications to the design of joint rate and admission control , 2003, Comput. Networks.

[30]  E. Gabrielyan,et al.  Network topology aware scheduling of collective communications , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[31]  Roger D. Hersch,et al.  Liquid Schedule Searching Strategies for the Optimization of Collective Network Communication , 2004, International Conference on Wireless Networks.

[32]  Roger D. Hersch,et al.  Efficient liquid schedule search strategies for collective communications , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[33]  Hussein Mouftah,et al.  Contention avoidance in optical burst switching , 2004 .

[34]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[35]  Václav Dvorák.  Scheduling collective communications on wormhole fat cubes , 2005, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05).

[36]  ResearchFlorham Park,et al.  Analytical Modeling of Routing Algorithms in Virtual Cut-Through Networks , 2008 .

[37]  Seon Ho Kim,et al.  Multimedia Servers , 2008, Encyclopedia of Multimedia.

[38]  Jing Hao.  Figure , 1972, Analysing Scientific Discourse From a Systemic Functional Linguistic Perspective.