default search action
CONPAR 1981: Nürnberg, Germany
- Wolfgang Händler:
CONPAR 81: Conference on Analysing Problem Classes and Programming for Parallel Computing, Nürnberg, Germany, June 10-12, 1981, Proceedings. Lecture Notes in Computer Science 111, Springer 1981, ISBN 3-540-10827-0 - Arthur W. Burks:
Programming and structure changes in parallel computers. 1-24
Matching The Structure Of Computations And Machine Architecture
- Frans J. Peters:
Tree machines and divide-and-conquer algorithms. 25-36 - M. Feller, Milos D. Ercegovac:
Queue machines: an organization for parallel computation. 37-47 - David A. Podsiadlo, Harry F. Jordan:
Operating systems support for the finite element machine. 48-65 - David J. Kuck:
Automatic program restructuring for high-speed computation. 66-84
Programming Languages Which Support Parallelism
- G. David, I. Losonczi, S. D. Papp:
Language support for designing multilevel computer systems. 85-100 - Jean-Pierre Banâtre, Michel Banâtre:
Parallel structures for vector processing. 101-114 - Ronald H. Perrott:
Language design approaches for parallel processors. 115-126 - Arthur H. Veen:
Reconciling data flow machines and conventional languages. 127-140 - Manfred Broy:
On language constructs for concurrent programs. 141-154 - John R. Gurd, John R. W. Glauert, Chris C. Kirkham:
Generation of dataflow graphical object code for the Lapse programming language. 155-168 - Tamás Legendi:
Cellular algorithms and their verification. 169-188
Cellular Algorithms And Their Verifications
- Josef Pecht:
The development of fast cellular pattern transformation algorithms using virtual boundaries. 189-202 - Endre Katona:
Cellular algorithms for binary matrix operations. 203-216
Systematic Design, Development, And Verification Of Parallel Algorithms
- Jørgen Staunstrup:
Analysis of concurrent algorithms. 217-230 - Pierre Lecouffe:
SAUGE: How to use the parallelism of sequential programs. 231-244 - Alberto Pettorossi:
A transformational approach for developing parallel programs. 245-258 - Christian Lengauer, Eric C. R. Hehner:
A methodolgy for programming with concurrency. 259-270 - Krithi Ramamritham, Robert M. Keller:
On synchronization and its specification. 271-282 - Peter M. Flanders:
Non-numerical aspects of computations on parallel hardware. 283-297
Nonnumerical Parallel Algorithms
- Steven R. House:
Compiling in parallel. 298-313 - Yossi Shiloach, Uzi Vishkin:
Finding the maximum, merging and sorting in a parallel computation model. 314-327 - Gerard Salton, Donna Bergmark:
Parallel computations in information retrieval. 328-342 - Daniel Gajski:
Recurrence semigroups and their relation to data storage in fast recurrence solvers on parallel machines. 343-357 - Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt:
Parallel algorithms for the convex hull problem in two dimensions. 358-372 - Udo Schendel:
On basic concepts in parallel numerical mathematics. 373-394 - V. Saad, Ahmed H. Sameh:
Iterative methods for the solution of elliptic difference equations on multiprocessors. 395-413
Parallelism Of Numerical Algorithms
- Nikola K. Kasabov, G. T. Bijev, B. J. Jechev:
Hierarchical discrete systems and realisation of parallel algorithms. 414-422 - Marián Vajtersic:
Solving two modified discrete poisson equations in 7 logn steps on n2 processors. 423-432 - Ladislav Halada:
A parallel algorithm for solving band systems and matrix inversion. 433-440 - Friedel Hossfeld, Peter Weidner:
Parallel evaluation of correlation time-of-flight experiments. 441-452 - Gerhard Fritsch, Horst Müller:
Parallelization of a minimization problem for multiprocessor systems. 453-463 - Jacques Julliand, Guy-René Perrin:
Design and development of concurrent programs. 464-479 - Eliezer Dekel, Sartaj Sahni:
Binary trees and parallel scheduling algorithms. 480-492 - J. Shanehchi, David J. Evans:
New variants of the quadrant interlocking factorisation (Q.I.F.) method. 493-507
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.