Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Explicit parallelism

In computer programming, explicit parallelism is the representationof concurrent computations by means of primitivesin the form of special-purpose… Expand
Wikipedia

Related topics

Related topics

10 relations

Broader (1)

Computer programming
Erlang (programming language)Implicit parallelismJavaManycore processor
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Introduction to Active Automata Learning from a Practical Perspective
In this chapter we give an introduction to active learning of Mealy machines, an automata model particularly suited for modeling… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Experimental Evaluation of Classical Automata Constructions
There are several algorithms for producing the canonical DFA from a given NFA. While the theoretical complexities of these… Expand
  • figure 2
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Performance evaluation and design trade-offs for network-on-chip interconnect architectures
Multiprocessor system-on-chip (MP-SoC) platforms are emerging as an important trend for SoC design. Power and wire design… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A decomposition approach for the scheduling of a steel plant production
Abstract In this paper we present a decomposition strategy for solving large scheduling problems using mathematical programming… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
An effective hybrid optimization strategy for job-shop scheduling problems
Abstract Simulated annealing is a naturally serial algorithm, but its behavior can be controlled by the cooling schedule. Genetic… Expand
  • figure 1
  • figure 4
  • figure 5
  • table 1
  • table 2
Is this relevant?
1997
1997
High resolution finite volume parallel simulations of mould filling and binary alloy solidification on unstructured 3-D meshes
The Los Alamos National Laboratory (LANL) is currently developing a new casting simulation tool (known as Telluride) that employs… Expand
Is this relevant?
1991
1991
The hierarchical task graph and its use in auto-scheduling
Auto-Scheduling defines a program compilation and execution tlamework which supports effective and efficient exploitation of… Expand
  • figure 1
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1991
1991
Analyzing Programs with Explicit Parallelism
When analyzing programs with parallel imperative constructs (e.g., cobegin/coend), standard computer intermediate representations… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Explicit Parallelism of Genetic Algorithms through Population Structures
Genetic algorithms imitate the collective learning paradigm found in living nature. They derive their power largely from their… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
1980
1980
Explicit parallelism in LISP-like languages
We introduce a LISP-like language whose parameter passing mechanism and control primitives allow for the creation and the… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE