Sciweavers

1710 search results - page 244 / 342
» Parallelism in Structured Newton Computations
Sort
View
PODC
2010
ACM
15 years 2 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
DAC
2009
ACM
15 years 2 months ago
NUDA: a non-uniform debugging architecture and non-intrusive race detection for many-core
Traditional debug methodologies are limited in their ability to provide debugging support for many-core parallel programming. Synchronization problems or bugs due to race conditio...
Chi-Neng Wen, Shu-Hsuan Chou, Tien-Fu Chen, Alan P...
107
Voted
HIPC
2007
Springer
15 years 2 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
EDOC
2004
IEEE
15 years 2 months ago
A Logical Viewpoint on Architectures
In this paper we introduce a logical viewpoint on architectures. The logical viewpoint is based on the distinction between symbolic and semantic models of architectures. The core ...
Frank S. de Boer, Marcello M. Bonsangue, Joost Jac...
CONCUR
2006
Springer
15 years 2 months ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan