PARLE '93 Parallel Architectures and Languages Europe 5th International PARLE Conference, Munich, Germany, June 14-17, 1993. Proceedings
Parallel processing offers a solution to the problem of providing the processing power necessary to help understand and master the complexity of natural phenomena and engineering structures. By taking several basic processing devices and connecting them together the potential exists of achieving a p...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1993, 1993
|
| Edition: | 1st ed. 1993 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Precis: Distributed shortest path algorithms
- A disabling of event structures
- Barrier semantics in very weak memory
- Using hammock graphs to eliminate nonstructured branch statements
- Performance modeling of microkernel thread schedulers for shared memory multiprocessors
- From data flow networks to process algebras
- Parallel complexity of lattice basis reduction and a floating-point parallel algorithm
- Computer vision applications experience with actors
- Grid massively parallel processor
- APPLAUSE: Application & assessment of parallel programming using logic
- EPOCH — European parallel operating system based on Chorus
- Pythagoras projectoverview (EP7091)
- A Parallel programming style and its algebra of programs
- B(PN) 2 — a basic Petri net programming notation
- A calculus of value broadcasts
- TRAPPER: A graphical programming environment for industrial high-performance applications
- Control and data flow visualization for parallel logic programs on a multi-window debugger HyperDEBU
- Artificial neural networks for the bipartite and k-partite subgraph problems
- Homogeneous neuronlike structures for optimization variational problem solving
- Effectiveness of heuristics and simulated annealing for the scheduling of concurrent tasks — An empirical comparison
- Task scheduling with restricted preemptions
- Effects of job size irregularity on the dynamic resource scheduling of a 2-D mesh multicomputer
- Static allocation of tasks on multiprocessor architectures with interprocessor communication delays
- PEI: a single unifying model to design parallel programs
- A compositional approach for fault-tolerance using specification transformation
- Concurrent MetateM — A language for modelling reactive systems
- Trace-based compositional reasoning about fault tolerant systems
- A Kahn principle for networks of nonmonotonic real-time processes
- Adaptive multicast wormhole routing in 2D mesh multicomputer
- The impact of packetization in wormhole-routed networks
- Grouping virtual channels for deadlock-free adaptive wormhole routing
- Monaco: A high-performance flat concurrent logic programming system
- Exploiting recursion-parallelism in Prolog
- Why and how in the ElipSys OR-parallel CLP system
- Skewed-associative caches
- Trace-splitting for the parallel simulation of cache memory
- Locality and false sharing in coherent-cache parallel graph reduction
- SLiD — A cost-effective and Scalable Limited-Directory schemefor cache coherence
- Formal development of actor programs using structured algebraic petri nets
- Simulation-based comparison of hash functions for emulated shared memory
- Task management, virtual shared memory, and multithreading in a distributed memory implementation of Sisal
- Simulating the data diffusion machine
- 2DT-FP: An FP based programming language for efficient parallel programming of multiprocessor networks
- The data-parallel categorical abstract machine
- Data parallel implementation of extensible sparse functional arrays
- Embeddings of tree-related networks in incomplete hypercubes
- Static and dynamic performance of the Möbius cubes (short version)
- Optimal mappings of m dimensional FFT communication to k dimensional mesh for arbitrary m and k
- Implicit parallelism: The united functions and objects approach
- Detection of recurrences in sequential programs with loops
- Parallel programming using skeleton functions
- Data-parallel portable software platform: Principles and implementation
- Computing the complete orthogonal decomposition using a SIMD array processor
- A dynamic load balancing strategy for massively parallel computers
- Issues in event abstraction
- Modelling replicated processing
- Performance of M3S for the SOR algorithm
- Multi-criteria: Degrees of recoverability in distributed databases
- Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions
- Convergence of asynchronous iterations of least fixed points
- LU-decomposition on a massively parallel transputer system
- PSEE: Parallel system evaluation environment
- Implementation of a digital modular chip for a reconfigurable artificial neural network
- Article-acquisition: A scenario for non-serializability in a distributed database
- An empirical study of vision programs for data dependence analysis
- Cyclic weighted reference counting without delay
- Parallel optimisation of join queries using an enhanced iterative improvement technique
- Correctness of automated distribution of sequential programs
- Compositionality issues of concurrent object-oriented logic languages
- Using state variables for the specification and verification of TCSP processes
- A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments
- A unifying look at semigroup computations on meshes with multiple broadcasting
- A fast, simple algorithm to balance a parallel multiway merge
- Some design aspects for VLIW architectures exploiting fine-grained parallelism
- Load balanced optimisation of virtualised algorithms for implementation on massively parallel SIMD architectures
- Performance evaluation of WASMII: a data driven computer on a virtual hardware
- On the performance of parallel join processing in sharednothing database systems
- Processing transactions on GRIP, a parallel graph reducer
- Arithmetic for parallel linear recursive query evaluation in deductive databases