Sciweavers

1845 search results - page 230 / 369
» Computing the Angularity Tolerance
Sort
View
HOTOS
2007
IEEE
15 years 6 months ago
Relaxed Determinism: Making Redundant Execution on Multiprocessors Practical
Given that the majority of future processors will contain an abundance of execution cores, redundant execution can offer a promising method for increasing the availability and res...
Jesse Pool, Ian Sin Kwok Wong, David Lie
ECAI
2006
Springer
15 years 6 months ago
Multi-Objective Propagation in Constraint Programming
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
Emma Rollon, Javier Larrosa
HICSS
1995
IEEE
109views Biometrics» more  HICSS 1995»
15 years 6 months ago
The architecture of an optimistic CPU: the WarpEngine
The architecture for a shared memory CPU is described. The CPU allows for parallelism down to the level of single instructions and is tolerant of memory latency. All executable in...
John G. Cleary, Murray Pearson, Husam Kinawi
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 3 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
CDES
2006
136views Hardware» more  CDES 2006»
15 years 3 months ago
Using Task Recomputation During Application Mapping in Parallel Embedded Architectures
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
Suleyman Tosun, Mahmut T. Kandemir, Hakduran Koc