Sciweavers

1119 search results - page 87 / 224
» Computing in the Presence of Timing Failures
Sort
View
OOPSLA
2004
Springer
15 years 11 months ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula
JSSPP
2007
Springer
15 years 12 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
WINE
2009
Springer
178views Economy» more  WINE 2009»
16 years 12 days ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
128
Voted
VLSID
2005
IEEE
98views VLSI» more  VLSID 2005»
16 years 6 months ago
False Path and Clock Scheduling Based Yield-Aware Gate Sizing
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
Jeng-Liang Tsai, Dong Hyun Baik, Charlie Chung-Pin...
177
Voted
FCT
1997
Springer
15 years 10 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis