Treffer: Procedure graphs and computer optimizations.

Title:
Procedure graphs and computer optimizations.
Contributors:
Ho, Kei Shiu Edward., Chinese University of Hong Kong Graduate School. Division of Computer Science.
Publisher Information:
Chinese University of Hong Kong
Publication Year:
1992
Collection:
The Chinese University of Hong Kong: CUHK Digital Repository / 香港中文大學數碼典藏
Document Type:
Fachzeitschrift text
File Description:
print; 202 leaves : ill.; 30 cm.
Language:
English
Rights:
Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Accession Number:
edsbas.29BDF5BE
Database:
BASE

Weitere Informationen

by Ho Kei Shiu Edward. ; Thesis (M.Phil.)--Chinese University of Hong Kong, 1992. ; Includes bibliographical references (leaves 199-202). ; Acknowledgement ; Abstract ; Chapter Chapter 1 --- Introduction --- p.1 ; Chapter 1.1 --- Initial Motivations --- p.1 ; Chapter 1.2 --- Objectives of Our Study --- p.2 ; Chapter 1.3 --- Outline of the Thesis --- p.3 ; Chapter Chapter 2 --- Basics of the Procedure Graph Theory --- p.6 ; Chapter 2.1 --- Introducing Procedure Graph Theory --- p.6 ; Chapter 2.1.1 --- "Nodes, Arcs and Pseudo-time Labels" --- p.7 ; Chapter 2.2 --- Examples --- p.12 ; Chapter 2.3 --- Exploring the Meanings of the Pseudo-time Labels --- p.13 ; Chapter 2.4 --- Equivalence and Transformation --- p.16 ; Chapter 2.4.1 --- Equivalence --- p.16 ; Chapter 2.4.2 --- Transmission Track and Causality Preservation --- p.16 ; Chapter 2.4.3 --- Transformation --- p.17 ; Chapter 2.4.3.1 --- Serial-to-Parallel Transformations (SP) --- p.18 ; Chapter 2.4.3.2 --- Parallel-to-Serial Transformations (PS) --- p.20 ; Chapter 2.4.3.3 --- Store-Store Cancellations (SSC) --- p.21 ; Chapter 2.4.3.4 --- Normalization of Pseudo-time Labels --- p.23 ; Chapter 2.4.3.5 --- Boundary Conditions and Multi-level Pseudo-time Labels --- p.24 ; Chapter 2.5 --- Procedure Graph Optimizations --- p.28 ; Chapter 2.5.1 --- Representing Dependencies --- p.28 ; Chapter 2.5.2 --- Eliminating Unnecessary Dependencies --- p.32 ; Chapter 2.6 --- Simulation Program --- p.36 ; Chapter 2.6.1 --- Preliminary Study Using the Simulation Program --- p.36 ; Chapter 2.6.2 --- Economic Factors --- p.37 ; Chapter 2.6.3 --- Combinatorial Explosion of Procedure Graphs --- p.38 ; Chapter Chapter 3 --- Extending the Procedure Graph Theory --- p.45 ; Chapter 3.1 --- The T-Operator and the F-Operator --- p.45 ; Chapter 3.2 --- Modifying the Firing Rule --- p.46 ; Chapter 3.3 --- Procedure Graph Representation for Different Branch Strategies --- p.49 ; Chapter 3.3.1 --- Multiple-Path Execution --- p.49 ; Chapter 3.3.2 --- Conditional Execution with Delayed ...