An application-driven study of multicast communication for write invalidation

Hung-Chang Hsiao, Chung Ta King

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In distributed shared-memory (DSM) multiprocessors, a write operation requires multiple messages to invalidate the nodes which share and cache the memory block to being written. The consequent write stall time impedes the performance of such systems. An effective means of achieving efficient invalidation is to employ multicast messages to reach the sharing nodes. This study evaluates two multicast-based invalidation schemes, dual-path and pruning, by performing application-driven simulation. The experimental settings used herein find that multicasts improve invalidation traffic for four of the six evaluated real applications. The remaining two applications are computationally intensive, and multicast-based invalidation is less effective. However, since multicasts encourage bursty communication, our results indicate that they help relieve network congestion during these periods. Dual-path performs slightly better than pruning, because it is less sensitive to routing delay in the routers. Our results further demonstrate that cache size is an important design parameter for multicast-based invalidation, and is highly effective for DSM multiprocessors with larger caches.

Original languageEnglish
Pages (from-to)279-304
Number of pages26
JournalJournal of Supercomputing
Volume18
Issue number3
DOIs
Publication statusPublished - 2001 Mar 1

Fingerprint

Multicast
Data storage equipment
Communication
Cache
Distributed Shared Memory
Shared-memory multiprocessors
Pruning
Routers
Path
Vertex of a graph
Router
Parameter Design
Congestion
Sharing
Routing
Traffic
Evaluate
Demonstrate
Simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture

Cite this

@article{b9da6879599b4818a1e1be6ddc45da2f,
title = "An application-driven study of multicast communication for write invalidation",
abstract = "In distributed shared-memory (DSM) multiprocessors, a write operation requires multiple messages to invalidate the nodes which share and cache the memory block to being written. The consequent write stall time impedes the performance of such systems. An effective means of achieving efficient invalidation is to employ multicast messages to reach the sharing nodes. This study evaluates two multicast-based invalidation schemes, dual-path and pruning, by performing application-driven simulation. The experimental settings used herein find that multicasts improve invalidation traffic for four of the six evaluated real applications. The remaining two applications are computationally intensive, and multicast-based invalidation is less effective. However, since multicasts encourage bursty communication, our results indicate that they help relieve network congestion during these periods. Dual-path performs slightly better than pruning, because it is less sensitive to routing delay in the routers. Our results further demonstrate that cache size is an important design parameter for multicast-based invalidation, and is highly effective for DSM multiprocessors with larger caches.",
author = "Hung-Chang Hsiao and King, {Chung Ta}",
year = "2001",
month = "3",
day = "1",
doi = "10.1023/A:1008161716113",
language = "English",
volume = "18",
pages = "279--304",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "3",

}

An application-driven study of multicast communication for write invalidation. / Hsiao, Hung-Chang; King, Chung Ta.

In: Journal of Supercomputing, Vol. 18, No. 3, 01.03.2001, p. 279-304.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An application-driven study of multicast communication for write invalidation

AU - Hsiao, Hung-Chang

AU - King, Chung Ta

PY - 2001/3/1

Y1 - 2001/3/1

N2 - In distributed shared-memory (DSM) multiprocessors, a write operation requires multiple messages to invalidate the nodes which share and cache the memory block to being written. The consequent write stall time impedes the performance of such systems. An effective means of achieving efficient invalidation is to employ multicast messages to reach the sharing nodes. This study evaluates two multicast-based invalidation schemes, dual-path and pruning, by performing application-driven simulation. The experimental settings used herein find that multicasts improve invalidation traffic for four of the six evaluated real applications. The remaining two applications are computationally intensive, and multicast-based invalidation is less effective. However, since multicasts encourage bursty communication, our results indicate that they help relieve network congestion during these periods. Dual-path performs slightly better than pruning, because it is less sensitive to routing delay in the routers. Our results further demonstrate that cache size is an important design parameter for multicast-based invalidation, and is highly effective for DSM multiprocessors with larger caches.

AB - In distributed shared-memory (DSM) multiprocessors, a write operation requires multiple messages to invalidate the nodes which share and cache the memory block to being written. The consequent write stall time impedes the performance of such systems. An effective means of achieving efficient invalidation is to employ multicast messages to reach the sharing nodes. This study evaluates two multicast-based invalidation schemes, dual-path and pruning, by performing application-driven simulation. The experimental settings used herein find that multicasts improve invalidation traffic for four of the six evaluated real applications. The remaining two applications are computationally intensive, and multicast-based invalidation is less effective. However, since multicasts encourage bursty communication, our results indicate that they help relieve network congestion during these periods. Dual-path performs slightly better than pruning, because it is less sensitive to routing delay in the routers. Our results further demonstrate that cache size is an important design parameter for multicast-based invalidation, and is highly effective for DSM multiprocessors with larger caches.

UR - http://www.scopus.com/inward/record.url?scp=0035277682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035277682&partnerID=8YFLogxK

U2 - 10.1023/A:1008161716113

DO - 10.1023/A:1008161716113

M3 - Article

VL - 18

SP - 279

EP - 304

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 3

ER -