Sciweavers

2019 search results - page 287 / 404
» Programming with Shared Data Abstractions
Sort
View
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 10 months ago
Liberalizing Dependency
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
Avik Chaudhuri
JDA
2006
85views more  JDA 2006»
14 years 9 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
PPL
2008
106views more  PPL 2008»
14 years 9 months ago
On Implementing the Farm Skeleton
Algorithmic skeletons intend to simplify parallel programming by providing a higher abstraction compared to the usual message passing. Task and data parallel skeletons can be dist...
Michael Poldner, Herbert Kuchen
TJS
2008
113views more  TJS 2008»
14 years 9 months ago
Improving the parallelism of iterative methods by aggressive loop fusion
Abstract. Traditionally, loop nests are fused only when the data dependences in the loop nests are not violated. This paper presents a new loop fusion algorithm that is capable of ...
Jingling Xue, Minyi Guo, Daming Wei
ECSA
2010
Springer
14 years 8 months ago
Industry taxonomy engineering: the case of the European software ecosystem
Presently, no methods exist that support the creation process of an industry taxonomy within a specific domain. Without such a method, taxonomies remain erroneous, making the deve...
Ivo Hunink, Rene van Erk, Slinger Jansen, Sjaak Br...