View in EDS

Automatic Loop Parallelization in the BSP Model

Saved in:
Bibliographic Details
Title: Automatic Loop Parallelization in the BSP Model
Authors: Radu Calinescu
Contributors: The Pennsylvania State University CiteSeerX Archives
Source: http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/europds98-paper.ps.gz.
Publication Year: 1998
Collection: CiteSeerX
Description: This paper introduces a new scheme for the scheduling of generic, untightly nested loops on distributed-memory systems. Being targeted at the bulk-synchronous parallel (BSP) model of computation, the novel parallelization scheme yields parallel code which is scalable, portable, and whose performance can be analytically evaluated. Keywords: automatic parallelization, BSP model 1. INTRODUCTION The prohibitive costs of parallel software design have led to an ever increasing interest in the automatic parallelization of existing sequential code. As a result, remarkable advances have been made in areas such as data dependence analysis [4], code transformation [3], and potential parallelism identification [2, 14]. Based on these theoretical advances, many parallelizing compilers and tools have been devised within the last decade or so [12]. While the parallel code generated by these automatic parallelizers has shown to be effective in many cases, it nevertheless lacks portability .
Document Type: text
File Description: application/postscript
Language: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2839
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2839
http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/europds98-paper.ps.gz
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Accession Number: edsbas.2C2B85B7
Database: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2839#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Calinescu%20R
    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: edsbas
DbLabel: BASE
An: edsbas.2C2B85B7
RelevancyScore: 824
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 823.78955078125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Automatic Loop Parallelization in the BSP Model
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Radu+Calinescu%22">Radu Calinescu</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: The Pennsylvania State University CiteSeerX Archives
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/europds98-paper.ps.gz</i>.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 1998
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: CiteSeerX
– Name: Abstract
  Label: Description
  Group: Ab
  Data: This paper introduces a new scheme for the scheduling of generic, untightly nested loops on distributed-memory systems. Being targeted at the bulk-synchronous parallel (BSP) model of computation, the novel parallelization scheme yields parallel code which is scalable, portable, and whose performance can be analytically evaluated. Keywords: automatic parallelization, BSP model 1. INTRODUCTION The prohibitive costs of parallel software design have led to an ever increasing interest in the automatic parallelization of existing sequential code. As a result, remarkable advances have been made in areas such as data dependence analysis [4], code transformation [3], and potential parallelism identification [2, 14]. Based on these theoretical advances, many parallelizing compilers and tools have been devised within the last decade or so [12]. While the parallel code generated by these automatic parallelizers has shown to be effective in many cases, it nevertheless lacks portability .
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: text
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/postscript
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2839
– Name: URL
  Label: Availability
  Group: URL
  Data: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.2839<br />http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/europds98-paper.ps.gz
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.2C2B85B7
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.2C2B85B7
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Titles:
      – TitleFull: Automatic Loop Parallelization in the BSP Model
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Radu Calinescu
      – PersonEntity:
          Name:
            NameFull: The Pennsylvania State University CiteSeerX Archives
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1998
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: http://www.comlab.ox.ac.uk/oucl/users/radu.calinescu/europds98-paper.ps.gz
              Type: main
ResultId 1