scispace - formally typeset
Search or ask a question
Topic

Degree of parallelism

About: Degree of parallelism is a research topic. Over the lifetime, 1515 publications have been published within this topic receiving 25546 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This work analyzes several implementations of logic operations and suggests an implementation whose complexity is no greater than the best theoretical realization of a Boolean function, and demonstrates the optimality of that realization to within a constant multiple for digital optical-computing systems realized by bulk spatially variant elements.
Abstract: Optical computing has been suggested as a means of achieving a high degree of parallelism for both scientific and symbolic applications. While a number of implementations of logic operations have been forwarded, all have some characteristic that prevents their direct extension to functions of a large number of input bits. We analyze several of these implementations and demonstrate that all these implementations require that some measure of the system (area, space–bandwidth product, or time) grow exponentially with the number of inputs. We then suggest an implementation whose complexity is no greater than the best theoretical realization of a Boolean function. We demonstrate the optimality of that realization, to within a constant multiple, for digital optical-computing systems realized by bulk spatially variant elements.

11 citations

Proceedings ArticleDOI
03 Nov 1994
TL;DR: This work gives a simple specification of a scheduler and presents three delay-insensitive implementations, one of which contains a high degree of parallelism and is simpler than previously proposed implementations.
Abstract: The committee problem involves the specification and design of a scheduler for committee meetings. It is a general resource allocation problem that combines both synchronization and mutual exclusion. We give a simple specification of a scheduler and present three delay-insensitive implementations. Our last implementation contains a high degree of parallelism and is simpler than previously proposed implementations.

10 citations

Patent
18 Jul 2012
TL;DR: In this article, a clock precision parallel simulation system for an on-chip multi-core processor, which comprises a processor subsystem, a storage subsystem and a simulation object subsystem, is described.
Abstract: The invention discloses a clock precision parallel simulation system for an on-chip multi-core processor, which comprises a processor subsystem, a storage subsystem and a simulation object subsystem. The system is characterized in that a module interlayer is arranged between the processor subsystem and the simulation object subsystem in the system and used for implementation of mapping from a logic processor to a simulation object machine, the module interlayer comprises a core module, a mapping interconnection network, a share cache memory, a memory and storage modules for other simulation object structures, wherein the core module is in one-to-one correspondence to a processor core and a private primary cache memory. Point-to-point synchronization is realized between the core module and the storage modules, and group synchronization is realized among the storage modules. The system has higher degree of parallelism and higher speed-up ratio, and performance of the system is promoted under the condition that delicate modeling of each component of the multi-core processor is maintained.

10 citations

Journal ArticleDOI
TL;DR: A highly scalable parallel algorithm based on a spatial decomposition of the general unstructured mesh is presented and two spatial decompositions are compared, the recursive inertia partitioning (RIP) algorithm and the Greedy algorithm.
Abstract: The planar generalized Yee (PGY) algorithm is an extension of the generalized Yee algorithm and the discrete surface integral (DSI) methods, which are based on explicit time-marching solutions of Maxwell's equations. Specifically, the PGY algorithm exploits the planar symmetries of printed microwave circuit devices, achieving great savings in both CPU time and memory. Since the PGY algorithm is an explicit method, it has a high degree of parallelism. To this end, a highly scalable parallel algorithm based on a spatial decomposition of the general unstructured mesh is presented. Two spatial decompositions are compared, the recursive inertia partitioning (RIP) algorithm and the Greedy algorithm. The Greedy algorithm provides optimal load balance, whereas the RIP algorithm more effectively minimizes shared boundary interface lengths. Through numerical examples, It is demostrated that the Greedy algorithm provides superior speedups. It is also demonstrated that the parallel PGY algorithm is a highly scalable algorithm.

10 citations

DOI
01 Jan 2001
TL;DR: A detailed three-dimensional computational model of the human cochlea is developed and refined, which uses the immersed boundary method to calculate the fluid-structure interactions produced in response to incoming sound waves.
Abstract: We have developed and are refining a detailed three-dimensional computational model of the human cochlea. The model uses the immersed boundary method to calculate the fluid-structure interactions produced in response to incoming sound waves. An accurate cochlear geometry obtained from physical measurements is incorporated. The model includes a detailed and realistic description of the various elastic structures present. Initially, a macro-mechanical computational model was developed for execution on a CRAY T90 at the San Diego Supercomputing Center. This code was ported to the latest generation of shared memory high performance servers from Hewlett Packard. Using compiler generated threads and OpenMP directives, we have achieved a high degree of parallelism in the executable, which has made possible to run several large scale numerical simulation experiments to study the interesting features of the cochlear system. In this paper, we outline the methods, algorithms and software tools that were used to implement and fine tune the code, and discuss some of the simulation results.

10 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
85% related
Scheduling (computing)
78.6K papers, 1.3M citations
83% related
Network packet
159.7K papers, 2.2M citations
80% related
Web service
57.6K papers, 989K citations
80% related
Quality of service
77.1K papers, 996.6K citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20221
202147
202048
201952
201870
201775