Coverart for item
The Resource Instruction level parallelism

Instruction level parallelism

Label
Instruction level parallelism
Title
Instruction level parallelism
Subject
Language
eng
Member of
Cataloging source
YDX
Dewey number
004
Index
no index present
LC call number
QA75.5-76.95
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/subjectName
  • Parallel processing (Electronic computers)
  • Compilers (Computer programs)
Label
Instruction level parallelism
Instantiates
Publication
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • List of Figures; List of Tables; Preface; Foreword; Acknowledgments; 1 Introduction; 1.1 Scope of the Book; 1.2 Instruction-Level Parallelism; 1.3 Outline of Topics; 2 Overview of ILP Architectures; 2.1 Historical Perspective; 2.2 Superscalar and VLIW Machines; 2.3 Early ILP Architectures; 2.4 ILP Architectures in the 80's; 2.5 ILP Architectures in the 90's; 2.6 Itanium; 2.6.1 The EPIC Philosophy; 2.6.2 Itanium Architecture; 3 Scheduling Basic Blocks; 3.1 Introduction; 3.2 Basic Concepts; 3.3 Unlimited Resources; 3.3.1 ASAP Algorithm; 3.3.2 ALAP Algorithm; 3.4 Limited Resources
  • 3.4.1 List Scheduling3.4.2 Linear Analysis; 3.5 An Example; 3.6 More Algorithms; 3.6.1 Critical Path Algorithm; 3.6.2 Restricted Branch and Bound Algorithm; 3.6.3 Force-Directed Scheduling; 3.7 Limited Beyond Basic Block Optimization; 4 Trace Scheduling; 4.1 Introduction; 4.2 Basic Concepts; 4.2.1 Program Model; 4.2.2 Traces; 4.2.3 Dependence; 4.2.4 Schedules; 4.2.5 Program Transformation; 4.3 Traces without Joins; 4.4 General Traces; 4.5 Trace Scheduling Algorithm; 4.6 Picking Traces; 5 Percolation Scheduling; 5.1 Introduction; 5.2 The Core Transformations; 5.2.1 Delete Transformation
  • 5.2.2 Move-op Transformation5.2.3 Move-test Transformation; 5.2.4 Unify Transformation; 5.3 Remarks; 5.3.1 Termination; 5.3.2 Completeness; 5.3.3 Confluence; 5.4 Extensions; 5.4.1 Migrate Transformation; 5.4.2 Trailblazing; 5.4.3 Resource-Constrained Percolation Scheduling; 6 Modulo Scheduling; 6.1 Introduction; 6.2 Unrolling; 6.3 Preliminaries; 6.4 Modulo Scheduling Algorithm; 6.4.1 Remarks; Sufficiency of simple cycles; Infeasibility of MII; 6.4.2 Limitations; 6.5 Modulo Scheduling with Conditionals; 6.5.1 Hierarchical Reduction; 6.5.2 Enhanced Modulo Scheduling
  • 6.5.3 Modulo Scheduling with Multiple InitiationIntervals6.6 Iterative Modulo Scheduling; 6.6.1 The Algorithm; Determining Scheduling Priority; Determining Earliest Start Time; Determining Candidate Time Slots; 6.7 Optimizations; 6.7.1 Modulo Variable Expansion; 6.7.2 Using Loop Unrolling to Enhance Modulo Scheduling; 7 Software Pipelining by Kernel Recognition; 7.1 Introduction; 7.1.1 Basic Idea; 7.2 The URPR Algorithm; 7.3 OPT: Optimal Loop Pipelining of Innermost Loops; 7.4 General Handling of Conditionals; 7.4.1 Perfect Pipelining; Compaction; The Algorithm
  • 7.4.2 Enhanced Pipeline-Percolation Scheduling7.4.3 Optimal Software Pipelining with Control Flow; 7.5 Nested Loops; 7.6 Procedure Calls; 8 Epilogue; Bibliography; Index
Dimensions
unknown
Extent
1 online resource
Form of item
online
Isbn
9781489977977
Media category
computer
Media MARC source
rdamedia
Media type code
c
Specific material designation
remote
System control number
  • SPR965145639
  • ocn965145639
Label
Instruction level parallelism
Publication
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • List of Figures; List of Tables; Preface; Foreword; Acknowledgments; 1 Introduction; 1.1 Scope of the Book; 1.2 Instruction-Level Parallelism; 1.3 Outline of Topics; 2 Overview of ILP Architectures; 2.1 Historical Perspective; 2.2 Superscalar and VLIW Machines; 2.3 Early ILP Architectures; 2.4 ILP Architectures in the 80's; 2.5 ILP Architectures in the 90's; 2.6 Itanium; 2.6.1 The EPIC Philosophy; 2.6.2 Itanium Architecture; 3 Scheduling Basic Blocks; 3.1 Introduction; 3.2 Basic Concepts; 3.3 Unlimited Resources; 3.3.1 ASAP Algorithm; 3.3.2 ALAP Algorithm; 3.4 Limited Resources
  • 3.4.1 List Scheduling3.4.2 Linear Analysis; 3.5 An Example; 3.6 More Algorithms; 3.6.1 Critical Path Algorithm; 3.6.2 Restricted Branch and Bound Algorithm; 3.6.3 Force-Directed Scheduling; 3.7 Limited Beyond Basic Block Optimization; 4 Trace Scheduling; 4.1 Introduction; 4.2 Basic Concepts; 4.2.1 Program Model; 4.2.2 Traces; 4.2.3 Dependence; 4.2.4 Schedules; 4.2.5 Program Transformation; 4.3 Traces without Joins; 4.4 General Traces; 4.5 Trace Scheduling Algorithm; 4.6 Picking Traces; 5 Percolation Scheduling; 5.1 Introduction; 5.2 The Core Transformations; 5.2.1 Delete Transformation
  • 5.2.2 Move-op Transformation5.2.3 Move-test Transformation; 5.2.4 Unify Transformation; 5.3 Remarks; 5.3.1 Termination; 5.3.2 Completeness; 5.3.3 Confluence; 5.4 Extensions; 5.4.1 Migrate Transformation; 5.4.2 Trailblazing; 5.4.3 Resource-Constrained Percolation Scheduling; 6 Modulo Scheduling; 6.1 Introduction; 6.2 Unrolling; 6.3 Preliminaries; 6.4 Modulo Scheduling Algorithm; 6.4.1 Remarks; Sufficiency of simple cycles; Infeasibility of MII; 6.4.2 Limitations; 6.5 Modulo Scheduling with Conditionals; 6.5.1 Hierarchical Reduction; 6.5.2 Enhanced Modulo Scheduling
  • 6.5.3 Modulo Scheduling with Multiple InitiationIntervals6.6 Iterative Modulo Scheduling; 6.6.1 The Algorithm; Determining Scheduling Priority; Determining Earliest Start Time; Determining Candidate Time Slots; 6.7 Optimizations; 6.7.1 Modulo Variable Expansion; 6.7.2 Using Loop Unrolling to Enhance Modulo Scheduling; 7 Software Pipelining by Kernel Recognition; 7.1 Introduction; 7.1.1 Basic Idea; 7.2 The URPR Algorithm; 7.3 OPT: Optimal Loop Pipelining of Innermost Loops; 7.4 General Handling of Conditionals; 7.4.1 Perfect Pipelining; Compaction; The Algorithm
  • 7.4.2 Enhanced Pipeline-Percolation Scheduling7.4.3 Optimal Software Pipelining with Control Flow; 7.5 Nested Loops; 7.6 Procedure Calls; 8 Epilogue; Bibliography; Index
Dimensions
unknown
Extent
1 online resource
Form of item
online
Isbn
9781489977977
Media category
computer
Media MARC source
rdamedia
Media type code
c
Specific material designation
remote
System control number
  • SPR965145639
  • ocn965145639

Library Locations

Processing Feedback ...