Sciweavers

4747 search results - page 621 / 950
» Shuffle Memory System
Sort
View
PODC
2009
ACM
15 years 11 months ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
CC
2001
Springer
146views System Software» more  CC 2001»
15 years 11 months ago
Alias Analysis by Means of a Model Checker
We study the application of a standard model checker tool, Spin, to the well-known problem of computing a may-alias relation for a C program. A precise may-alias relation can signi...
Vincenzo Martena, Pierluigi San Pietro
SAGA
2001
Springer
15 years 11 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
ICPP
2000
IEEE
15 years 11 months ago
Runtime Parallel Incremental Scheduling of DAGs
A runtime parallel incremental DAG scheduling approach is described in this paper. A DAG is expanded incrementally, scheduled, and executed on a parallel machine. A DAG scheduling...
Min-You Wu, Wei Shu, Yong Chen
ASPDAC
2000
ACM
107views Hardware» more  ASPDAC 2000»
15 years 11 months ago
Taiwan foundry for system-in-package (SIP)
-- System-In-Package (SIP) is a cost-effective alternative to System-On-Chip (SOC) and chips with embedded memory. The key elements of SIP technology include I/O redistribution, so...
Albert Lin