Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,604,133 papers from all fields of science
Search
Sign In
Create Free Account
Parallel computing
Known as:
Parallel Programming
, Asynchronous programming
, Concurrent language
Expand
Parallel computing is a type of computation in which many calculations or the execution of processes are carried out simultaneously. Large problems…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
4-bit
Algorithmica
AmigaOne X1000
BOINC
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Efficient parallel skyline processing using hyperplane projections
Henning Köhler
,
J. Yang
,
Xiaofang Zhou
ACM SIGMOD Conference
2011
Corpus ID: 3683266
The skyline of a set of multi-dimensional points (tuples) consists of those points for which no clearly better point exists in…
Expand
Highly Cited
2010
Highly Cited
2010
PAPER www.rsc.org/softmatter | Soft Matter Mechanomutable properties of a PAA/PAH polyelectrolyte complex: rate dependence and ionization effects on tunable adhesion strength
2010
Corpus ID: 7202775
Highly Cited
2007
Highly Cited
2007
The performance of multiple-instruction-issue processors can be severely limited the IMPACT Architectural Framework , a set of architectural features that best
José F. Martínez
,
Walid A. Najjar
2007
Corpus ID: 15751065
A Compilation and Run-Time Framework for Maximizing Performance of Self-scheduling Comparative architectural characterization of…
Expand
Highly Cited
1996
Highly Cited
1996
Adaption at Specific Loci. VI. Divergence vs. Parallelism of Polymorphic Allozymes in Molecular Function and Fitness-Component Effects Among Colias Species (Lepidoptera, Pieridae)
W. B. Watt
,
Kathleen Donahue
,
P. Carter
1996
Corpus ID: 14824401
In lowland Cobs butterflies, genotypes of the enzyme phosphoglucose isomerase (PGI) show major differences in molecular function…
Expand
Highly Cited
1992
Highly Cited
1992
Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems
Virgílio A. F. Almeida
,
I. Vasconcelos
,
J. Árabe
,
D. Menascé
Proceedings Supercomputing '92
1992
Corpus ID: 17539058
The authors consider multiprogrammed multiprocessors and parallel programs modeled as random task graphs. A theoretical…
Expand
Highly Cited
1988
Highly Cited
1988
On the morphological parallelism between compounds and constructs
H. Borer
1988
Corpus ID: 116137879
Highly Cited
1985
Highly Cited
1985
A multiprocessor-based controller for the control of mechanical manipulators
R. Nigam
,
C. S. Lee
Proceedings. IEEE International Conference on…
1985
Corpus ID: 31522422
This paper describes a cost effective architecture for the control of mechanical manipulators based on a functional decomposition…
Expand
Highly Cited
1983
Highly Cited
1983
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
Dhruva Nath
,
S. Maheshwari
,
P. Bhatt
IEEE transactions on computers
1983
Corpus ID: 22667234
In this paper we describe two interconnection networks for parallel processing, namely the orthogonal trees network and the…
Expand
Highly Cited
1983
Highly Cited
1983
A pyramidal approach to parallel processing
S. Tanimoto
International Symposium on Computer Architecture
1983
Corpus ID: 16019468
This paper presents the architecture of a parallel computer called a pyramid machine. The system consists of a pyramidal array of…
Expand
Highly Cited
1982
Highly Cited
1982
Routing Schemes for the Augmented Data Manipulator Network in an MIMD System
Robert J. McMillen
,
H. Siegel
IEEE transactions on computers
1982
Corpus ID: 9758075
There have been many multistage interconnection networks proposed in the literature for interconnecting the processors that…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE