Titlebook: CONPAR 86; Conference on Algori Wolfgang Händler,Dieter Haupt,Otto Lange Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986

Facilities

Implementing branch-and-bound in a ring of processors,sages with its two ring neighbors..A branch-and-bound procedure is implemented in Pascal to run in parallel on the ring and solve the Travelling-Salesman-Problem. Heuristics are developed to maintain a priority queue in a distributed heap. The computing times and speedups for 25 random graphs obtained with up to 16 ring members are discussed.

Inflammation

狗舍

978-3-540-16811-9Springer-Verlag Berlin Heidelberg 1986

Compass

使腐烂

Caltech hypercube MIMD computer performances measurements in a physical mathematical application,A Caltech Hypercube has been characterized using known methods to obtain performance figures from a MIMD computer. Speed-up, efficiency and communication cost have been evaluated versus the number of used processors and the physical problem dimensions.

FER

Die Sicherheit von nuklearen Systemen,e analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.

小鹿

https://doi.org/10.1007/978-3-322-86465-9sor computers with two and four vector processors. The algorithms are intended to use all processors in parallel as far as possible under the condition that the vector efficiency in the parallel tasks does not substantially decrease. We report numerical results for programs using the multitasking routines on 1 and 2-processor CRAY-X/MP.

endocardium

Ischemia

An adaptable cluster structure of (,), -II,e analyzed at the beginning of computation. Then the size of each cluster and the connections between clusters are adapted to the problem automatically. Using this mechanism, effective computation is possible in various types of problems.

夹克怕包裹