Sciweavers

463 search results - page 58 / 93
» Collective Communications for Scalable Programming
Sort
View
PPL
2008
106views more  PPL 2008»
15 years 3 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
ATAL
2009
Springer
15 years 10 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
OOPSLA
2010
Springer
15 years 2 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
15 years 9 months ago
Reducing the Forwarding State Requirements of Point-to-Multipoint Trees Using MPLS Multicast
IP multicast was first proposed to improve the performance of applications that require group communications. Still, many years after its initial proposal, IP multicast is not wi...
George Apostolopoulos, Ioana Ciurea
139
Voted
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
15 years 9 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...