Scheduling communication requests traversing a switch: complexity and algorithms

被引：1
|
作者：
Gallet, Matthieu [1 ]
Robert, Yves [1 ]
Vivien, Frederic [1 ]
机构：
[1] Lyon INRIA UCBL 5668, ENS, UMR CNRS, Lab Informat Parallelisme, Lyon, France
来源：
15TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/PDP.2007.73
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we study the problem of scheduling file transfers through a, switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network interconnecting the various clusters that compose the grid. We establish several complexity results, and we introduce and analyze various algorithms, from both a theoretical and a practical perspective.
引用
收藏
页码：39 / +
页数：2
相关论文
共 50 条
  • [1] Low-Complexity Switch Scheduling Algorithms: Delay Optimality in Heavy Traffic
    Jhunjhunwala, Prakirt Raj
    Maguluri, Siva Theja
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2022, 30 (01) : 464 - 473
  • [2] Container Scheduling: Complexity and Algorithms
    Choi, Byung-Cheon
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedo, Michael L.
    Briskorn, Dirk
    PRODUCTION AND OPERATIONS MANAGEMENT, 2012, 21 (01) : 115 - 128
  • [3] Broadcast Scheduling: Algorithms and Complexity
    Chang, Jessica
    Erlebach, Thomas
    Gailis, Renars
    Khuller, Samir
    ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
  • [4] Broadcast Scheduling: Algorithms and Complexity
    Chang, Jessica
    Erlebach, Thomas
    Gailis, Renars
    Khuller, Samir
    PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 473 - +
  • [5] CALL SCHEDULING ALGORITHMS IN A MULTICAST SWITCH
    KIM, CK
    LEE, TT
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (03) : 625 - 635
  • [6] THE COMPLEXITY OF THE MAXIMAL REQUESTS SATISFACTION PROBLEM IN MULTIPOINT COMMUNICATION
    Barth, Dominique
    Berthome, Pascal
    Fragopoulou, Paraskevi
    PARALLEL PROCESSING LETTERS, 2005, 15 (1-2)
  • [7] Scheduling with interference decoding: Complexity and algorithms
    Goussevskaia, O.
    Wattenhofer, R.
    AD HOC NETWORKS, 2013, 11 (06) : 1732 - 1745
  • [8] Guaranteed smooth switch scheduling with low complexity
    Mohanty, SR
    Bhuyan, LN
    GLOBECOM '05: IEEE Global Telecommunications Conference, Vols 1-6: DISCOVERY PAST AND FUTURE, 2005, : 626 - 630
  • [9] On the complexity of scheduling with large communication delays
    Bampis, E
    Giannakos, A
    Konig, JC
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) : 252 - 260
  • [10] Scheduling algorithms for OBS switch with shared buffer
    Chi, H
    Zeng, QJ
    Zhao, HD
    Luo, JT
    Zhang, ZZ
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2003, E86B (07) : 2220 - 2223
12345