Skip to search formSkip to main contentSkip to account menu

Implicit parallelism

In computer science, implicit parallelism is a characteristic of a programming language that allows a compiler or interpreter to automatically… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
AxumCompilerComputer scienceData-intensive computing

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On the Accuracy of Partially Implicit Schemes for Phase Field Modeling
Partially implicit (or partially explicit) schemes, such as the convex splitting schemes (CSS in short), are among the most… 
2014
2014
Effective persistent homology of digital images
In this paper, three Computational Topology methods (namely effective homology, persistent homology and discrete vector fields… 
2014
2014
Reservoir and Surface Facilities Coupled Through Partially and Fully Implicit Approaches
During oil production, the change of production states could cause the change of pressure losses through the production… 
2006
2006
Subword-Parallel VLIW Architecture Exploration for Multimode Software Defined Radio
Software defined radios (SDR) requires an application-specific programmable architecture with instruction set targeted toward… 
2002
2002
Exploiting Task-Level Parallelism Automatically Using pTask
Existing systems supporting task-level parallelism often involve the process of task synchronization and/or task creation. Task… 
2002
2002
Sliding windows multiuser detectors for TD-SCDMA system
In CWTS TD-CDMA systems, block-based algorithms adopted in the BTS are well suited for multiuser detection (MUD) in presence of… 
2001
2001
Parallelizing MCP-Haskell for Evaluating Haskell# Parallel Programming Environment
In this paper, we present the parallelization of a sequential functional implementation of a Monte Carlo Transport Problem… 
1997
1997
Lower Time and Processor Bounds for Efficient Mapping of Uniform Dependence Algorithms into Systolic Arrays
One of the most promising areas of research is the area of automatic parallelization of sequential algorithms, where the primary… 
1993
1993
The Rule-Based Multi-Agent System MAGSY
This paper presents the rule-based multi-agent system MAGSY. The kernel of an agent in MAGSY is a forward-chaining rule… 
Review
1985
Review
1985
A Brief Survey of Implicit Parallelism Detection
This chapter contains sections titled: Background, Transformations, Intermediate Program Representation, Open Problems… 
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)