Sciweavers

549 search results - page 26 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
ICFP
2003
ACM
15 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
CCGRID
2006
IEEE
15 years 1 months ago
Efficient Many-to-One Communication for a Distributed RAID
Any set of autonomous workstations, however networked (by a LAN, a MAN, or wireless), can be seen as a collection of networked low cost disks. Such a collection can be operated by...
Alessandro Di Marco, Giuseppe Ciaccio
CCGRID
2005
IEEE
15 years 3 months ago
Logistical multicast for data distribution
This paper describes a simple scheduling procedure for use in multicast data distribution within a logistical networking infrastructure. The goal of our scheduler is to generate a...
Jason Zurawski, D. Martin Swany, Micah Beck, Ying ...
IPPS
1997
IEEE
15 years 1 months ago
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of su...
Shiwa S. Fu, Nian-Feng Tzeng, Zhiyuan Li
ICPADS
2006
IEEE
15 years 3 months ago
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
Mohammad El-Hajj, Osmar R. Zaïane