Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles: DFG German National Licenses  (2)
  • COMPILER OPTIMIZATION  (1)
  • macrotasking  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Cedar Fortran and other vector and parallel Fortran dialects (1990)
    Springer
    The journal of supercomputing 4 (1990), S. 37-62 
    Details
    ISSN: 1573-0484
    Keywords: block-parallel ; Cedar Fortran ; Doall ; Doacross ; Fortran ; language constructs ; macrotasking ; microtasking ; multiprocessing ; synchronization ; unstructured tasking ; vector processing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The introduction of vector processors and multiprocessors has caused the most dramatic changes in Fortran and its dialects. The emerging generation of supercomputers utilizes both vector processing and multiprocessing. The challenge is to provide language constructs and software tools that will allow the programmer to easily exploit the capabilities of the machine. This paper outlines the development of vector and multiprocessor language constructs in Fortran. Significant architectures, their languages, and optimizers are described. The paper concludes with a description of Cedar Fortran, the language for the Cedar Multiprocessor under development at the University of Illinois, Urbana-Champaign. Cedar is a hierarchical, shared-memory, vector multiprocessor. As such, its language, Cedar Fortran, contains many of the language features that are described for vector processors and multiprocessors.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00162342
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Constant Propagation Algorithm for Explicitly Parallel Programs (1998)
    Springer
    International journal of parallel programming 26 (1998), S. 563-589 
    Details
    ISSN: 1573-7640
    Keywords: COMPILER OPTIMIZATION ; CONSTANT PROPAGATION ; CONTROL FLOW GRAPH ; EXPLICIT PARALLELISM ; INTERMEDIATE REPRESENTATION ; STATIC SINGLE ASSIGNMENT FORM
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we present a constant propagation algorithm for explicitly parallel programs, which we call the Concurrent Sparse Conditional Constant propagation algorithm. This algorithm is an extension of the Sparse Conditional Constant propagation algorithm. Without considering the interaction between threads, classical optimizations lead to an incorrect program transformation for parallel programs. To make analyzing parallel programs possible, a new intermediate representation is needed. We introduce the Concurrent Static Single Assignment (CSSA) form to represent explicitly parallel programs with interleaving semantics and synchronization. The only parallel construct considered in this paper is cobegin/coend. A new confluence function, the π-assignment, which summarizes the information of interleaving statements between threads, is introduced. The Concurrent Control Flow Graph, which contains information about conflicting statements, control flow, and synchronization, is used as an underlying representation for the CSSA from.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018772514882
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...