Load-balancing on swapped or OTIS networks

Saved in:
Bibliographic Details
Title: Load-balancing on swapped or OTIS networks
Authors: Zhao, Chenggui1,2 zhaochenggui@126.com, Xiao, Wenjun2 wjxiao@scut.edu.cn, Parhami, Behrooz3 parhami@ece.ucsb.edu
Source: Journal of Parallel & Distributed Computing. Apr2009, Vol. 69 Issue 4, p389-399. 11p.
Subjects: Computer networks, Semiconductor diffusion, Computer simulation, Harmonic functions
Abstract: Abstract: Existing local iterative algorithms for load-balancing are ill-suited to many large-scale interconnection networks. The main reasons are complicated Laplace spectrum computations and flow scheduling strategies. Many large-scale networks are modular and/or hierarchically structured, a prime example being the class of swapped or OTIS networks that have received much attention in recent years. We propose a new local scheme, called DED-X, for load-balancing on homogeneous and heterogeneous swapped/OTIS networks. Our scheme needs spectral information only for the much smaller basis or factor graph, which is of size rather than , and it schedules load flow on intragroup and intergroup links separately. We justify the improvements offered by DED-X schemes over traditional X schemes analytically and verify the advantages of our approach, in terms of efficiency and stability, via simulation. [Copyright &y& Elsevier]
Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 36893683
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Load-balancing on swapped or OTIS networks
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhao%2C+Chenggui%22">Zhao, Chenggui</searchLink><relatesTo>1,2</relatesTo><i> zhaochenggui@126.com</i><br /><searchLink fieldCode="AR" term="%22Xiao%2C+Wenjun%22">Xiao, Wenjun</searchLink><relatesTo>2</relatesTo><i> wjxiao@scut.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Parhami%2C+Behrooz%22">Parhami, Behrooz</searchLink><relatesTo>3</relatesTo><i> parhami@ece.ucsb.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Parallel+%26+Distributed+Computing%22">Journal of Parallel & Distributed Computing</searchLink>. Apr2009, Vol. 69 Issue 4, p389-399. 11p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Semiconductor+diffusion%22">Semiconductor diffusion</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink><br /><searchLink fieldCode="DE" term="%22Harmonic+functions%22">Harmonic functions</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract: Existing local iterative algorithms for load-balancing are ill-suited to many large-scale interconnection networks. The main reasons are complicated Laplace spectrum computations and flow scheduling strategies. Many large-scale networks are modular and/or hierarchically structured, a prime example being the class of swapped or OTIS networks that have received much attention in recent years. We propose a new local scheme, called DED-X, for load-balancing on homogeneous and heterogeneous swapped/OTIS networks. Our scheme needs spectral information only for the much smaller basis or factor graph, which is of size rather than , and it schedules load flow on intragroup and intergroup links separately. We justify the improvements offered by DED-X schemes over traditional X schemes analytically and verify the advantages of our approach, in terms of efficiency and stability, via simulation. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=36893683
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.jpdc.2009.01.002
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 389
    Subjects:
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Semiconductor diffusion
        Type: general
      – SubjectFull: Computer simulation
        Type: general
      – SubjectFull: Harmonic functions
        Type: general
    Titles:
      – TitleFull: Load-balancing on swapped or OTIS networks
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhao, Chenggui
      – PersonEntity:
          Name:
            NameFull: Xiao, Wenjun
      – PersonEntity:
          Name:
            NameFull: Parhami, Behrooz
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2009
              Type: published
              Y: 2009
          Identifiers:
            – Type: issn-print
              Value: 07437315
          Numbering:
            – Type: volume
              Value: 69
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of Parallel & Distributed Computing
              Type: main
ResultId 1