Synthesizing synchronous systems by static scheduling in space-time

Lisper, B

Title: Synthesizing synchronous systems by static scheduling in space-time

Full Record
Other Related Research

Abstract

The subject of this book is the synthesis of synchronous hardware. The purpose is to provide a firm mathematical foundation for the so-called space-time mapping methods for hardware synthesis that have been proposed during the last few years. Thus the treatment is fairly mathematical. In a space-time mapping method, an algorithm is described as a set of atomic events, with possible data dependencies between them. The task is to find a mapping, assigning a space-time coordinate to each event, so that causality is not violated and the solution is good. In this project algebra is used and the close connection with singe-assignment languages is stressed. The results presented can be applied to hardware construction and compiler techniques for parallel computers.

Authors:

Lisper, B ^[1]

Royal Inst. of Tech., Stockholm (Sweden)

Publication Date:: Sun Jan 01 00:00:00 EST 1989

OSTI Identifier:: 5345942

Resource Type:: Book

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; TECHNOLOGY ASSESSMENT; SUPERCONDUCTORS; COMPUTER CODES; MATHEMATICS; SPACE-TIME; SYNCHRONIZATION; PROGRAMMING; 990200* - Mathematics & Computers

Citation Formats


                    Lisper, B. Synthesizing synchronous systems by static scheduling in space-time.  United States: N. p., 1989. 
        Web.

Copy to clipboard


                    Lisper, B. Synthesizing synchronous systems by static scheduling in space-time.  United States.

Copy to clipboard


                    Lisper, B. 1989.  
        "Synthesizing synchronous systems by static scheduling in space-time".  United States.

Copy to clipboard


                    
@article{osti_5345942,

  title        = {Synthesizing synchronous systems by static scheduling in space-time},

  author       = {Lisper, B},

  abstractNote = {The subject of this book is the synthesis of synchronous hardware. The purpose is to provide a firm mathematical foundation for the so-called space-time mapping methods for hardware synthesis that have been proposed during the last few years. Thus the treatment is fairly mathematical. In a space-time mapping method, an algorithm is described as a set of atomic events, with possible data dependencies between them. The task is to find a mapping, assigning a space-time coordinate to each event, so that causality is not violated and the solution is good. In this project algebra is used and the close connection with singe-assignment languages is stressed. The results presented can be applied to hardware construction and compiler techniques for parallel computers.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/5345942},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Sun Jan 01 00:00:00 EST 1989},

  month        = {Sun Jan 01 00:00:00 EST 1989}

}

Copy to clipboard

Book:

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this book.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Efficient static scheduling of loops on synchronous multiprocessors

Miscellaneous Zaky, A

This dissertation investigates efficient compile-time scheduling techniques for exploiting parallelism on synchronous multiprocessors. Synchronous multiprocessors, e.g. Very Long Instruction Word (VLIW) machines, are very effective in utilizing unstructured fine-grained parallelism in programs. The effectiveness of such machines is crucially dependent on the static compile-time analysis and detection of potential parallelism. The first part of the dissertation focuses on scheduling sequential loops on multiprocessors with multiple identical processor units. The problem of determining the maximal initiation rate for the execution of a sequential loop with uniform dependence distances on a synchronous multiprocessor is addressed and cast as an eigenvalue problem inmore »« less
Static scheduling of synchronous data flow programs for digital signal processing

Journal Article Lee, E; Messerschmitt, D - IEEE Trans. Comput.; (United States)

Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of programmer convenience. This is particularly true when the target machine is a programmable DSP chip. However, the runtime overhead inherent in most LGDF implementations is not required for most signal processing systems because such systems are mostly synchronous (in the DSP sense). Synchronous data flow (SDF) differs from traditional data flow in that the amount ofmore »« less
https://doi.org/10.1109/TC.1987.5009446
Software-Driven Network Architecture for Synchronous Data Acquisition

Technical Report McMillian, Gary; McMillian, Brett; DeWitt, Michael

Experiments at facilities such as the Facility for Rare Isotope Beams (FRIB) involve thousands of detector elements that produce raw experimental data at rates in excess of a GB/sec using new Flash ADC (FADC) based detectors. Data acquisition systems convert detector signals into a digital form in real-time. The data from each detector element is labeled with a precisely synchronized timestamp and transmitted to buffers. The total charge, the number of coincident elements, or other information summaries are used to determine whether something interesting has happened, which constitutes a trigger. If justified by the trigger, the data from these elementsmore »« less
Architectures for statically scheduled dataflow

Journal Article Lee, E; Bier, J - Journal of Parallel and Distributed Computing; (United States)

When dataflow program graphs can be statically scheduled, little run-time overhead (software or hardware) is necessary. This paper describes a class of parallel architectures consisting of von Neumann processors and one or more shared memories, where the order of shared- memory access is determined at compile time and enforced at run time. The architecture is extremely lean in hardware, yet for a set of important applications it can perform as well as any shared-memory architecture. Dataflow graphs can be mapped onto it statically. Furthermore, it supports shared data structures without the run-time overhead of I-structures. A software environment has beenmore »« less
A Testbed of Parallel Kernels for Computer Science Research

Technical Report Bailey, David; Demmel, James; Ibrahim, Khaled; ...

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descentmore »« less
https://doi.org/10.2172/983273

Full Text Available

Similar Records