View in EDS

Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.

Saved in:
Bibliographic Details
Title: Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.
Authors: Rosenberg, Arnold L.1 rsnbrg@cs.umass.edu., Yurkewych, Matthew1 yurkl@cs.umass.edu.
Source: IEEE Transactions on Computers. Apr2005, Vol. 54 Issue 4, p428-438. 11p.
Subject Terms: *INTERNET, *BROADBAND communication systems, *COMPUTATIONAL complexity, *INTEGRATED circuits, *INFORMATION technology
Company/Entity: COMPUTATIONAL Biology Corp.
Abstract: A "pebble game" is developed to model the process of scheduling computation-dags for Internet-based computing (IC, for short). Strategies are derived for scheduling three common, significant families of such dags for IC: reduction-meshes, which represent (the intertask dependencies of) computations that can be performed by "up-sweeps" of meshes; reduction-trees, which represent "accumulative" computations that can be performed by "up-sweeps" of trees; and FFT(Fast Fourier Transform) dags, which represent a large variety of convolutional computations. Two criteria are used to assess the quality of a schedule: its memory requirements and its rate of producing tasks that are eligible for allocation to remote clients. These criteria are important because of, respectively, the typically enormous sizes of IC computations and the typical temporal unpredictability of remote clients in IC. In particular, a high production rate of eligible tasks decreases a computation's vulnerability to the gridlock that can occur when a computation stalls pending the return of intermediate results by remote clients. Under idealized assumptions, the schedules derived are optimal in the rate of producing eligible tasks and are either exactly or approximately optimal in memory requirements. [ABSTRACT FROM AUTHOR]
Database: Academic Search Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:asx&genre=article&issn=00189340&ISBN=&volume=54&issue=4&date=20050401&spage=428&pages=428-438&title=IEEE Transactions on Computers&atitle=Guidelines%20for%20Scheduling%20Some%20Common%20Computation-Dags%20for%20Internet-Based%20Computing.&aulast=Rosenberg%2C%20Arnold%20L.&id=DOI:10.1109/TC.2005.65
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Rosenberg%20AL
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: asx
DbLabel: Academic Search Index
An: 16484398
RelevancyScore: 1202
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1202.33801269531
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Rosenberg%2C+Arnold+L%2E%22">Rosenberg, Arnold L.</searchLink><relatesTo>1</relatesTo><i> rsnbrg@cs.umass.edu.</i><br /><searchLink fieldCode="AR" term="%22Yurkewych%2C+Matthew%22">Yurkewych, Matthew</searchLink><relatesTo>1</relatesTo><i> yurkl@cs.umass.edu.</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Computers%22">IEEE Transactions on Computers</searchLink>. Apr2005, Vol. 54 Issue 4, p428-438. 11p.
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: *<searchLink fieldCode="DE" term="%22INTERNET%22">INTERNET</searchLink><br />*<searchLink fieldCode="DE" term="%22BROADBAND+communication+systems%22">BROADBAND communication systems</searchLink><br />*<searchLink fieldCode="DE" term="%22COMPUTATIONAL+complexity%22">COMPUTATIONAL complexity</searchLink><br />*<searchLink fieldCode="DE" term="%22INTEGRATED+circuits%22">INTEGRATED circuits</searchLink><br />*<searchLink fieldCode="DE" term="%22INFORMATION+technology%22">INFORMATION technology</searchLink>
– Name: SubjectCompany
  Label: Company/Entity
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22COMPUTATIONAL+Biology+Corp%2E%22">COMPUTATIONAL Biology Corp.</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A "pebble game" is developed to model the process of scheduling computation-dags for Internet-based computing (IC, for short). Strategies are derived for scheduling three common, significant families of such dags for IC: reduction-meshes, which represent (the intertask dependencies of) computations that can be performed by "up-sweeps" of meshes; reduction-trees, which represent "accumulative" computations that can be performed by "up-sweeps" of trees; and FFT(Fast Fourier Transform) dags, which represent a large variety of convolutional computations. Two criteria are used to assess the quality of a schedule: its memory requirements and its rate of producing tasks that are eligible for allocation to remote clients. These criteria are important because of, respectively, the typically enormous sizes of IC computations and the typical temporal unpredictability of remote clients in IC. In particular, a high production rate of eligible tasks decreases a computation's vulnerability to the gridlock that can occur when a computation stalls pending the return of intermediate results by remote clients. Under idealized assumptions, the schedules derived are optimal in the rate of producing eligible tasks and are either exactly or approximately optimal in memory requirements. [ABSTRACT FROM AUTHOR]
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=asx&AN=16484398
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TC.2005.65
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 11
        StartPage: 428
    Subjects:
      – SubjectFull: COMPUTATIONAL Biology Corp.
        Type: general
      – SubjectFull: INTERNET
        Type: general
      – SubjectFull: BROADBAND communication systems
        Type: general
      – SubjectFull: COMPUTATIONAL complexity
        Type: general
      – SubjectFull: INTEGRATED circuits
        Type: general
      – SubjectFull: INFORMATION technology
        Type: general
    Titles:
      – TitleFull: Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Rosenberg, Arnold L.
      – PersonEntity:
          Name:
            NameFull: Yurkewych, Matthew
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 00189340
          Numbering:
            – Type: volume
              Value: 54
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: IEEE Transactions on Computers
              Type: main
ResultId 1