Skip to main navigation Skip to search Skip to main content

Complexity Analysis of Load Balance Problem for Synchronous Iterative Applications

  • Weizhe Zhang*
  • , Mingzeng Hu
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Load balance technologies for tightly coupled applications on the large scale heterogeneous cluster systems are paid more and more attentions nowadays with the emergence of the Meta computing and Grid computing environment. Focusing on a class of representative tightly coupled applications, synchronous iterative applications, we formulate their load balance problem into a combination optimization problem. Meanwhile, we establish a complexity result that accesses the difficulty of the problem. The theory analysis result will do great help for the design of approximate algorithms.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHai Jin, Jianhua Sun, Yi Pan, Nong Xiao
PublisherSpringer Verlag
Pages201-208
Number of pages8
ISBN (Print)3540235647, 9783540235644
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

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

Fingerprint

Dive into the research topics of 'Complexity Analysis of Load Balance Problem for Synchronous Iterative Applications'. Together they form a unique fingerprint.

Cite this