Exploring the Network-Sensitive Scheduling on Distributed Shared Memory

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Distributed shared memory abstraction can organize a cluster of machine nodes to empower the application execution with the big memory spaces and abundant parallelism. However, when deploying an application on the distributed shared memory, these loosely-coupled machine nodes may also make the execution of its tasks suffer from the frequent network traffic based on the existing scheduling strategies. In this paper, we conduct a detailed case study to reveal that the network-intensive task and poor data locality contribute to the major part of network traffic, which could impose the network burden on the execution. To address this issue, we propose the network-sensitive scheduling that fully takes the network traffic into the consideration of scheduling on DSM. The experimental results reveal that this network-sensitive scheduling can reduce the execution time by up to 32%, and decrease the network traffic by 18% under the real-world cases.

Original languageEnglish
Title of host publicationProceedings - 2021 IEEE 14th International Conference on Cloud Computing, CLOUD 2021
EditorsClaudio Agostino Ardagna, Carl K. Chang, Ernesto Daminai, Rajiv Ranjan, Zhongjie Wang, Robert Ward, Jia Zhang, Wensheng Zhang
PublisherIEEE Computer Society
Pages720-722
Number of pages3
ISBN (Electronic)9781665400602
DOIs
StatePublished - Sep 2021
Event14th IEEE International Conference on Cloud Computing, CLOUD 2021 - Virtual, Online, United States
Duration: 5 Sep 202111 Sep 2021

Publication series

NameIEEE International Conference on Cloud Computing, CLOUD
Volume2021-September
ISSN (Print)2159-6182
ISSN (Electronic)2159-6190

Conference

Conference14th IEEE International Conference on Cloud Computing, CLOUD 2021
Country/TerritoryUnited States
CityVirtual, Online
Period5/09/2111/09/21

Keywords

  • Data Locality
  • Distributed Shared Memory
  • Network Bound
  • Task Scheduling

Fingerprint

Dive into the research topics of 'Exploring the Network-Sensitive Scheduling on Distributed Shared Memory'. Together they form a unique fingerprint.

Cite this