IEICE TRANSACTIONS on Information
Job Mapping and Scheduling on Free-Space Optical Networks
Summary :
A number of parallel applications run on a high-performance computing (HPC) system simultaneously. Job mapping and scheduling become crucial to improve system utilization, because fragmentation prevents an incoming job from being assigned even if there are enough compute nodes unused. Wireless supercomputers and datacenters with free-space optical (FSO) terminals have been proposed to replace the conventional wired interconnection so that a diverse application workload can be better supported by changing their network topologies. In this study we firstly present an efficient job mapping by swapping the endpoints of FSO links in a wireless HPC system. Our evaluation shows that an FSO-equipped wireless HPC system can achieve shorter average queuing length and queuing time for all the dispatched user jobs. Secondly, we consider the use of a more complicated and enhanced scheduling algorithm, which can further improve the system utilization over different host networks, as well as the average response time for all the dispatched user jobs. Finally, we present the performance advantages of the proposed wireless HPC system under more practical assumptions such as different cabinet capacities and diverse subtopology packings.
- Publication
- IEICE TRANSACTIONS on Information Vol.E99-D No.11 pp.2694-2704
- Publication Date
- 2016/11/01
- Publicized
- 2016/08/16
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016EDP7193
- Type of Manuscript
- PAPER
- Category
- Computer System
Authors
Yao HU
National Institute of Informatics
Ikki FUJIWARA
National Institute of Informatics
Michihiro KOIBUCHI
National Institute of Informatics
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Yao HU, Ikki FUJIWARA, Michihiro KOIBUCHI, "Job Mapping and Scheduling on Free-Space Optical Networks" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 11, pp. 2694-2704, November 2016, doi: 10.1587/transinf.2016EDP7193.
Abstract: A number of parallel applications run on a high-performance computing (HPC) system simultaneously. Job mapping and scheduling become crucial to improve system utilization, because fragmentation prevents an incoming job from being assigned even if there are enough compute nodes unused. Wireless supercomputers and datacenters with free-space optical (FSO) terminals have been proposed to replace the conventional wired interconnection so that a diverse application workload can be better supported by changing their network topologies. In this study we firstly present an efficient job mapping by swapping the endpoints of FSO links in a wireless HPC system. Our evaluation shows that an FSO-equipped wireless HPC system can achieve shorter average queuing length and queuing time for all the dispatched user jobs. Secondly, we consider the use of a more complicated and enhanced scheduling algorithm, which can further improve the system utilization over different host networks, as well as the average response time for all the dispatched user jobs. Finally, we present the performance advantages of the proposed wireless HPC system under more practical assumptions such as different cabinet capacities and diverse subtopology packings.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDP7193/_p
Copy
@ARTICLE{e99-d_11_2694,
author={Yao HU, Ikki FUJIWARA, Michihiro KOIBUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Job Mapping and Scheduling on Free-Space Optical Networks},
year={2016},
volume={E99-D},
number={11},
pages={2694-2704},
abstract={A number of parallel applications run on a high-performance computing (HPC) system simultaneously. Job mapping and scheduling become crucial to improve system utilization, because fragmentation prevents an incoming job from being assigned even if there are enough compute nodes unused. Wireless supercomputers and datacenters with free-space optical (FSO) terminals have been proposed to replace the conventional wired interconnection so that a diverse application workload can be better supported by changing their network topologies. In this study we firstly present an efficient job mapping by swapping the endpoints of FSO links in a wireless HPC system. Our evaluation shows that an FSO-equipped wireless HPC system can achieve shorter average queuing length and queuing time for all the dispatched user jobs. Secondly, we consider the use of a more complicated and enhanced scheduling algorithm, which can further improve the system utilization over different host networks, as well as the average response time for all the dispatched user jobs. Finally, we present the performance advantages of the proposed wireless HPC system under more practical assumptions such as different cabinet capacities and diverse subtopology packings.},
keywords={},
doi={10.1587/transinf.2016EDP7193},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Job Mapping and Scheduling on Free-Space Optical Networks
T2 - IEICE TRANSACTIONS on Information
SP - 2694
EP - 2704
AU - Yao HU
AU - Ikki FUJIWARA
AU - Michihiro KOIBUCHI
PY - 2016
DO - 10.1587/transinf.2016EDP7193
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2016
AB - A number of parallel applications run on a high-performance computing (HPC) system simultaneously. Job mapping and scheduling become crucial to improve system utilization, because fragmentation prevents an incoming job from being assigned even if there are enough compute nodes unused. Wireless supercomputers and datacenters with free-space optical (FSO) terminals have been proposed to replace the conventional wired interconnection so that a diverse application workload can be better supported by changing their network topologies. In this study we firstly present an efficient job mapping by swapping the endpoints of FSO links in a wireless HPC system. Our evaluation shows that an FSO-equipped wireless HPC system can achieve shorter average queuing length and queuing time for all the dispatched user jobs. Secondly, we consider the use of a more complicated and enhanced scheduling algorithm, which can further improve the system utilization over different host networks, as well as the average response time for all the dispatched user jobs. Finally, we present the performance advantages of the proposed wireless HPC system under more practical assumptions such as different cabinet capacities and diverse subtopology packings.
ER -
English
