Proceedings 20th International Conference Parallel Processing 1991, 2. sējumsCRC Press, 1991. gada 6. aug. - 330 lappuses |
Saturs
Performance Evaluation | 1 |
An Effectiveness Study of Parallelizing Compiler Techniques II17 | 17 |
Compilers 1 | 26 |
The Tiny Loop Restructuring Research Tool II46 | 46 |
On Synchronization Patterns in Parallel Programs II60 | 60 |
A NonBlocking Algorithm for Shared Queues Using CompareandSwap II68 | 68 |
Data Issues | 76 |
An Integrated HardwareSoftware Solution for Effective Management of Local Storage | 83 |
Intelligent Scheduling ANDand ORParallelism in the Parallel Logic Programming | 186 |
Portable Software | 193 |
On the Synthesis of Programs for Various Parallel Architectures II202 | 202 |
Paragon A Parallel Programming Environment for Scientific Applications Using | 211 |
Programming Models and Paradigms | 219 |
ObjectOriented Programming for Massively Parallel Machines II227 | 227 |
Task Scheduling | 236 |
ChainBased Partitioning and Scheduling of Nested Loops for Multicomputers II243 | 243 |
Dynamic Load Sharing in the Presence of Information Obsolescence in Distributed | 91 |
Performance Evaluation 2 | 99 |
Recovering Uncorrupted Event Traces from Corrupted Event Traces in ParallelDistributed | 108 |
Experimental Verification of the Critical Path Simulation of an SIMDMIMD Parallel | 113 |
Compilers 2 | 124 |
On Loop Transformations for Generalized Cycle Shrinking II132 | 132 |
The Effect of Compiler Optimizations on Available Parallelism in Scalar Programs II142 | 142 |
Operating Systems | 150 |
OS Experimentation and a User Community Coexist Under the DUnX Kernel II158 | 158 |
Locking and Reference Counting in the Mach Kernel II167 | 167 |
Tasks 2 | 174 |
Directed Taskgraph Scheduling Using Simulated Annealing II180 | 180 |
Dynamic Loop Scheduling for ShareMemory Multiprocessors II247 | 247 |
POSTER SESSION | 258 |
Message Passing and Dynamic Scheduling on Looselycoupled Multiprocessor Systems II264 | 264 |
Characterization and Measurement of Parallelism in Communications Protocol Software II270 | 270 |
The Booster Approach to Annotating Parallel Algorithms II276 | 276 |
FortranStyle Transformations for Functional Programs II282 | 282 |
Workload Scheduling A New Technique for Scheduling Task Graphs with Communication | 288 |
Reducing Latency in DoSpread Loops with Constant Dependence Distances II294 | 294 |
Efficient Distributed Deadlock Detection and Resolution in Semantic LockBased Systems II300 | 300 |
| A-1 | |
Bieži izmantoti vārdi un frāzes
allocated analysis application architecture array block cache chare communication compile-time compiler complex Computer Science concurrent context switches cost cycles data dependence data structure database delay described distributed memory doacross DUnX dynamic efficient elements endfor example Figure Fortran function global graph hardware IEEE implementation index set instances integer interchanging iteration space kernel language load balancing lock logic programming Mach kernel machine mapping matrix memory simulator message passing method monitoring multicomputers multiple multiprocessor nested loops node number of processors object operating system OPS5 optimal overhead paper Paragon Parallel Computing Parallel Processing parallel programs parameters partitioning PASM performance Pmax priority problem procedure processor queue recursive reference Research restructuring rule run-time scheduling Section sequential shared memory specific speedup statement strategy Supercomputing superscalar synchronization Tango tasks techniques tion trans transaction transformation tuple unimodular matrix University variable vector