scientific article; zbMATH DE number 194119
From MaRDI portal
Publication:4040908
zbMATH Open0699.68007MaRDI QIDQ4040908FDOQ4040908
Authors:
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)
Cited In (32)
- COMPILE TIME PARTITIONING OF NESTED LOOP ITERATION SPACES WITH NON-UNIFORM DEPENDENCES*
- Data dependence and its application to parallel processing
- An introduction to compilation issues for parallel machines
- Speedup studies of leading iteration model for non-DO loops in comparison with sequential iteration model
- Title not available (Why is that?)
- Beyond unimodular transformations
- Test suite oscillations
- Distributed computing on cluster systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A UNIVERSAL MAPPING FOR NESTED LOOPS IN PARALLEL PROGRAMMING
- Verification by Parallelization of Parametric Code
- Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP
- Partitioning and mapping of nested loops for linear array multicomputers
- A singular loop transformation framework based on non-singular matrices
- Title not available (Why is that?)
- Data dependence in simple and compound program pipelines
- Title not available (Why is that?)
- Experience with the Super Monaco optimizing compiler
- A theory of compaction-based parallelization
- ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
- THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*
- Title not available (Why is that?)
- A study of scalar compilation techniques for pipelined supercomputers
- A formal development of an efficient supercombination compiler
- Loop skewing: the wavefront method revisited
- The program dependence graph and its use in optimization
- Parallelism analysis and optimization in SPEFY, a programming environment
- On the parallel complexity of loops
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Constraint preservation through loops
- Loop parallelisation for pvm-based distributed-memory systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040908)
