On stalling in LogP

  • Gianfranco Bilardi
  • , Kieran T. Herley
  • , Andrea Pietracaprina
  • , Geppino Pucci

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

We investigate the issue of stalling in the LogP model. In particular, we introduce a novel quantitative characterization of stalling, referred to as δ-stalling, which intuitively captures the realistic assumption that once the network's capacity constraint is violated, it takes some time (at most δ) for this information to propagate to the processors involved. We prove a lower bound that shows that LogP under δ-stalling is strictly more powerful than the stall-free version of the model where only strictly stall-free computations are permitted. On the other hand, we show that δ-stalling LogP with δ = L can be simulated with at most logarithmic slowdown by a BSP machine with similar bandwidth and latency values, thus extending the equivalence (up to logarithmic factors) between stall-free LogP and BSP argued in [1] to the more powerful L-stalling LogP.

Original languageEnglish
Title of host publicationParallel and Distributed Processing - 15 IPDPS 2000 Workshops, Proceedings
EditorsJose Rolim
PublisherSpringer Verlag
Pages109-115
Number of pages7
ISBN (Print)354067442X, 9783540674429
DOIs
Publication statusPublished - 2000
Event15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium, IPDPS 2000 - Cancun, Mexico
Duration: 1 May 20005 May 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1800 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium, IPDPS 2000
Country/TerritoryMexico
CityCancun
Period1/05/005/05/00

Fingerprint

Dive into the research topics of 'On stalling in LogP'. Together they form a unique fingerprint.

Cite this