Sciweavers

3052 search results - page 16 / 611
» Weakly Distributive Domains
Sort
View
ASPDAC
2011
ACM
217views Hardware» more  ASPDAC 2011»
14 years 1 months ago
Realization and performance comparison of sequential and weak memory consistency models in network-on-chip based multi-core syst
This paper studies realization and performance comparison of the sequential and weak consistency models in the network-on-chip (NoC) based distributed shared memory (DSM) multi-cor...
Abdul Naeem, Xiaowen Chen, Zhonghai Lu, Axel Jants...
ICWE
2003
Springer
15 years 2 months ago
Genre and Domain Processing in an Information Retrieval Perspective
Abstract. The massive amount of textual data on the Web raises numerous classification problems. Although the notion of domain is widely acknowledged in the IR field, the applica...
Céline Poudat, Guillaume Cleuziou
FTCS
1993
97views more  FTCS 1993»
14 years 11 months ago
Virtually-Synchronous Communication Based on a Weak Failure Suspector
Failure detectors (or, more accurately Failure Suspectors { FS) appear to be a fundamental service upon which to build fault-tolerant, distributed applications. This paper shows t...
André Schiper, Aleta Ricciardi
ICDCS
2010
IEEE
14 years 9 months ago
Complexity Analysis of Weak Multitolerance
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
Jingshu Chen, Sandeep Kulkarni
SPAA
2009
ACM
15 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch