IEEE Transactions on Computers · 1989 · 65 citations · 28 references
ComputingComputer EngineeringComputer ScienceParallel AlgorithmsParallel ComputingScientific ComputingMultiprocessor SystemsParallel ArchitecturesParallel ComputationParallel Computer ArchitectureParallel Numerical MethodsShared-memory ParallelismCommunication Overhead ReductionCrossbar SwitchesCrossbar SwitchingLinear System SolversMemory BandwidthParallel Computing ArchitecturesParallel Linear System SolversShared Memory
An architecture called an orthogonal multiprocessor (OMP) is proposed. This OMP architecture has a simplified busing structure and partially shared memory and compares very favorably with fully shared-memory multiprocessors using crossbar switches, multiple buses, or multistage networks. The higher performance comes mainly from significantly increased memory bandwidth, fully exploited parallelism, reduced communication overhead, and lower hardware control complexities. Parallel algorithms being mapped include matrix arithmetic, linear system solver, FFT, array sorting, linear programming, and parallel PDE solutions. In most cases, linear speedup can be achieved on the OMP system. The OMP architecture provides linearly scalable performance and is well suited for building special-purpose scientific computers.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
28
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
J.W. Mark · Proceedings of the IEEE · 1975 · 1.6K citations
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Computer architecture and parallel processing
Yigal Hoffner · Microprocessors and Microsystems · 1985 · 1.2K citations
Charles L. Seitz · Communications of the ACM · 1985 · 1.2K citations · Full text