Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining

Lee, G

Title: Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining

Full Record
Other Related Research

Abstract

Use of automatic program restructuring and memory access combining for a general-purpose large-scale shared memory machine is investigated. Effects of unpredictable control flows and data accesses on the effectiveness of automatic program restructuring are considered through the experiments of several basic nonnumerical programs. Various loop structures found are classified, and their effects are investigated. Also, the importance of algorithm change is considered. In addition, a way of parallelizing loops with conditional branching is studied. Several schemes of memory access combining are investigated. Inherent limit in the idea of memory access combining is revealed, and the effectiveness of those schemes is studied. An approximate formula to provide bounds on the best possible performance of memory access combining is developed, and a practical scheme to achieve performance close to such bounds in modest-sized machines is proposed.

Authors:: Lee, G

Publication Date:: Wed Jan 01 00:00:00 EST 1986

Research Org.:: Illinois Univ., Urbana (USA)

OSTI Identifier:: 6518177

Resource Type:: Thesis/Dissertation

Resource Relation:: Other Information: Thesis (Ph. D)

Country of Publication:: United States

Language:: English

Subject:: 29 ENERGY PLANNING, POLICY AND ECONOMY; ARRAY PROCESSORS; PARALLEL PROCESSING; ALGORITHMS; MEMORY DEVICES; PERFORMANCE; MATHEMATICAL LOGIC; PROGRAMMING; 291000* - Energy Planning & Policy- Conservation

Citation Formats


                    Lee, G. Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining.  United States: N. p., 1986. 
        Web.

Copy to clipboard


                    Lee, G. Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining.  United States.

Copy to clipboard


                    Lee, G. 1986.  
        "Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining".  United States.

Copy to clipboard


                    
@article{osti_6518177,

  title        = {Some issues in general-purpose shared memory multiprocessing: parallelism exploitation and memory access combining},

  author       = {Lee, G},

  abstractNote = {Use of automatic program restructuring and memory access combining for a general-purpose large-scale shared memory machine is investigated. Effects of unpredictable control flows and data accesses on the effectiveness of automatic program restructuring are considered through the experiments of several basic nonnumerical programs. Various loop structures found are classified, and their effects are investigated. Also, the importance of algorithm change is considered. In addition, a way of parallelizing loops with conditional branching is studied. Several schemes of memory access combining are investigated. Inherent limit in the idea of memory access combining is revealed, and the effectiveness of those schemes is studied. An approximate formula to provide bounds on the best possible performance of memory access combining is developed, and a practical scheme to achieve performance close to such bounds in modest-sized machines is proposed.},

  doi          = {},

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

  volume       = ,

  place        = {United States},

  year         = {Wed Jan 01 00:00:00 EST 1986},

  month        = {Wed Jan 01 00:00:00 EST 1986}

}

Copy to clipboard

Thesis/Dissertation:

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 thesis or dissertation.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Some issues in general-purpose shared memory multiprocessing: Parallelism exploitation and memory access combining

Technical Report Lee, Gyungho

The use of automatic program restructuring and memory access combining for ''general-purpose'' large scale shared memory machine is investigated. The effects of unpredictable control flows and data accesses on the effectiveness of automatic program restructuring are considered through the experiments of several basic nonnumerical programs. Various loop structures found are classified, and their effects are investigated. Also, the importance of algorithm change is considered. In addition, a way of parallelizing loops with conditional branching is studied. Several schemes of memory access combining are investigated. Inherent limit in the idea of memory access combining is revealed, and the effectiveness of thosemore »« less
The interprocedural analysis and automatic parallelization of scheme programs

Miscellaneous Harrison, III, W

Lisp and its descendants are among the most important and widely used of programming languages. At the same time, parallelism in the architecture of computer systems is becoming commonplace. There is a pressing need to extend the technology of automatic parallelization that has become available to Fortran programmers of parallel machines, to the realm of Lisp programs and symbolic computing. In this thesis the authors presents a comprehensive approach to the compilation of Scheme programs for share-memory multiprocessors. The strategy has two principal components: interprocedural analysis and program restructuring. He introduces procedure strings and stack configurations as a framework inmore »« less
Exploring Shared Memory Protocols in FLASH

Technical Report Horowitz, Mark; Kunz, Robert; Hall, Mary; ...

ABSTRACT The goal of this project was to improve the performance of large scientific and engineering applications through collaborative hardware and software mechanisms to manage the memory hierarchy of non-uniform memory access time (NUMA) shared-memory machines, as well as their component individual processors. In spite of the programming advantages of shared-memory platforms, obtaining good performance for large scientific and engineering applications on such machines can be challenging. Because communication between processors is managed implicitly by the hardware, rather than expressed by the programmer, application performance may suffer from unintended communication – communication that the programmer did not consider when developingmore »« less
https://doi.org/10.2172/939091

Full Text Available
Access ordering and coherence in shared-memory multi-processors

Book Scheurich, C

Shared memory forms a convenient communication medium in a multitasking multiprocessor system. However, different multiprocessors can execute the same program in different manners, possibly yielding incorrect results because the machines adhere to different rules. Differences in behavior are due to the varying approaches of designers to attack the shared memory access latency problem in multiprocessors. In particular, the manner in which multiple copies of data are controlled and the manner in which memory accesses are sequenced, propagated, and buffered has impact on the behavior of the multiprocessor. Three shared memory execution models, referred to as concurrency models, are defined. Themore »« less
Rapid Memory Footprint Access Diagnostics

Conference Kilic, Ozgur; Tallent, Nathan; Friese, Ryan

Footprint and reuse distance measure temporal locality and therefore do not capture the significance of access patterns (spacial locality). A strided access pattern has the largest possible footprint but usually has the best performance. To highlight exposed memory latency, we separate footprint into strided (prefetchable) and irregular (non-prefetchable) access components and calculate the growth rate of each. To rapidly compute these footprint access diagnostics, we present two methods, whole-program and precise. Current footprint analyses can cause 200× or more slowdown with realistic inputs and are therefore impractical. Our whole-program method reduces the overhead to 10% by computing upper bounds, butmore »« less

Similar Records