Sciweavers

224 search results - page 23 / 45
» A parallel repetition theorem
Sort
View
PLDI
2009
ACM
14 years 10 days ago
Progress guarantee for parallel programs via bounded lock-freedom
Parallel platforms are becoming ubiquitous with modern computing systems. Many parallel applications attempt to avoid locks in order to achieve high responsiveness, aid scalabilit...
Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaa...
APAL
2006
73views more  APAL 2006»
13 years 7 months ago
On the parallel between the suplattice and preframe approaches to locale theory
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
Christopher F. Townsend
CONCUR
1999
Springer
13 years 12 months ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
IPPS
2008
IEEE
14 years 2 months ago
DC-SIMD : Dynamic communication for SIMD processors
SIMD (single instruction multiple data)-type processors have been found very efficient in image processing applications, because their repetitive structure is able to exploit the...
Raymond Frijns, Hamed Fatemi, Bart Mesman, Henk Co...
KDD
1994
ACM
82views Data Mining» more  KDD 1994»
13 years 11 months ago
Architectural Support for Data Mining
Oneof the mainobstacles in applying data mining techniques to large, real-world databasesis the lack of efficient data management.In this paper, wepresent the design and implement...
Marcel Holsheimer, Martin L. Kersten