Parallel processing : CONPAR 94-VAPP VI : third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 6 8, 1994 : proceedings
This volume presents the proceedings of the Third Joint International Conference on Vector and Parallel Processing (CONPAR 94 - VAPP VI), held in Linz, Austria in September 1994. The 76 papers contained were carefully selected from a wealth of submissions and address the most important aspects of pa...
Bewaard in:
| Coauteur: | |
|---|---|
| Andere auteurs: | , |
| Formaat: | Livre numérique |
| Taal: | Anglais |
| Gepubliceerd in: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Reeks: | Lecture notes in computer science
854 |
| Onderwerpen: | |
| Online toegang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Opmerking: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Parallel processing, CONPAR 94-VAPP VI, third Joint International Conference on Vector and Parallel Processing, Linz, Austria, September 1994, proceedings, Bruno Buchberger, Jens Volkert (eds.), Berlin, Springer-Verlag, 1994, 1 volume (XVI-893 pages), Lecture notes in computer science, 3-540-58430-7 • Parallel Processing: CONPAR 94 - VAPP VI, Texte imprimé, 9783662176672 |
Inhoudsopgave:
- Scalability and programmability of massively parallel processors
- Language constructs and runtime systems for compositional parallel programming
- Locality optimizations for parallel machines
- TAU: A portable parallel program analysis environment for pC++
- Communication pattern based performance prediction on the nCUBE 2 multiprocessor system
- Performance oriented development of SPMD programs based on task structure specifications
- Monitoring for detecting bugs and blocking communication
- Minimizing the log size for execution replay of shared-memory programs
- Gold Mine specification language for event-based monitoring
- On the expressivity of a weakest precondition calculus for a simple data-parallel programming language (short version)
- Reduction in Pei
- Towards the synthesis of asynchronous concurrent programs
- Formal derivation of SIMD parallelism from non-linear recursive specifications
- Deriving efficient parallel implementations of algorithms operating on general sparse matrices using automatic program transformation
- Flexible program and architecture specification for massively parallel systems
- Systematic approach and software tool for systolic design
- ADVISE agricultural developmental visualisation interactive software environment
- TOP2 tool suite for the development and testing of parallel applications
- Vectorization of the radix r self-sorting FFT
- Efficient Gram-Schmidt orthogonalisation on an array processor
- Parallel algorithm for inverting tridiagonal matrix on linear processor array
- Systolic algorithms for long integer GCD computation
- Parallelization of non-simultaneous iterative methods for systems of linear equations
- Hypercube implementation and performance analysis for extrapolation methods
- An approach to machine-independentparallel programming
- On logic program parallelisation strategies
- Paradigms admitting superunitary behaviour in parallel computation
- Exact solution of linear systems over rational numbers by parallel p-adic arithmetic
- Parallel computation of modular multivariate polynomial resultants on a shared memory machine
- Partial Marking GC
- Parallel recognition and location algorithms for chordal graphs using distance matrices
- Comparing two probabilistic models of the computational complexity of the branch and bound algorithm
- Parallel heap construction using multiple selection
- Engineering high quality parallel software using PARSE
- Massively parallel volume rendering
- Parallel visibility computations for parallel radiosity
- Memory access synchronization in vector multiprocessors
- A switch cache design for MIN-based shared-memory multiprocessors
- Modeling cache coherence overhead with geometric objects
- Accelerated access to shared distributed arrays on distributed memory systems by access objects
- A comparison of shared virtual memory and message passing programming techniques based on a finite element application
- Comparison between a message passing and a global shared memory parallel computer by means of a concrete Monte-Carlo algorithm
- Non homogenous parallel memory operations in a VLIW machine
- Experience with the implementation of a concurrent graph reduction system on an nCUBE/2 platform
- The Rewrite Rule Machine node architecture and its performance
- Automatic spark strategies and granularity for a parallel functional language reducer
- Virtual tasks for the PACLIB kernel
- MUSE: a message passing concurrent computer for on-board space systems
- Self-timed communication strategies for massively parallel systolic architectures
- VIM language paradigm
- Distributed Linda tuplespace algorithms and implementations
- Supporting coarse and fine grain parallelism in an extension of ML
- Towards mixed computation/communication in parallel scientific libraries
- Composing functional unit blocks for efficient Interpretation of MIMD code sequences on SIMD processors
- Using sacks to organize registers in VLIW machines
- A framework for resource-constrained rate-optimal software pipelining
- Design of a meta-parallelizer for large scientific applications
- A software architecture for multidisciplinary applications: Integrating task and data parallelism
- On scanning space-time mapped while loops
- Optimizing communications by using compile time analysis
- Optimal tile sizing
- Evaluating array expressions on massively parallel machines with communication/computation overlap
- User interaction and symbolic extensions to dependence analysis
- Simplifying polynomial constraints over integers to make dependence analysis more precise
- Asymptotically optimal communication algorithms on faulty folded petersen networks
- Optimization of diagnostic examination
- Laying out midimew networks with constant dilation
- Optimal interval routing
- Broadcasting in bus interconnection networks
- Broadcasting in the arrowhead torus
- An efficient mapping heuristic for mesh-connected parallel architectures based on Mean Field Annealing
- Mapping and scheduling by genetic algorithms
- Self-organizing processes
- Balancing load under large and fast load changes in distributed computing systems A case study
- Dynamic load balancing mechanisms for a parallel operating system kernel
- A new load-prediction scheme based on algorithmic cost functions.