Sciweavers

478 search results - page 19 / 96
» Context-Sensitive Dependency Pairs
Sort
View
CGO
2004
IEEE
15 years 3 months ago
Using Dynamic Binary Translation to Fuse Dependent Instructions
Instruction scheduling hardware can be simplified and easily pipelined if pairs of dependent instructions are fused so they share a single instruction scheduling slot. We study an...
Shiliang Hu, James E. Smith
ISORC
2000
IEEE
15 years 4 months ago
Scheduling Solutions for Supporting Dependable Real-Time Applications
This paper deals with tolerance to timing faults in time-constrained systems. TAFT (Time Aware Fault-Tolerant) is a recently devised approach which applies tolerance to timing vio...
F. Sandrini, Felicita Di Giandomenico, Andrea Bond...
96
Voted
ESORICS
2006
Springer
15 years 3 months ago
Reducing the Dependence of SPKI/SDSI on PKI
Abstract. Trust-management systems address the authorization problem in distributed systems. They offer several advantages over other approaches, such as support for delegation and...
Hao Wang, Somesh Jha, Thomas W. Reps, Stefan Schwo...
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
14 years 12 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan
ICPP
2006
IEEE
15 years 5 months ago
Data-Flow Analysis for MPI Programs
Message passing via MPI is widely used in singleprogram, multiple-data (SPMD) parallel programs. Existing data-flow frameworks do not model the semantics of message-passing SPMD ...
Michelle Mills Strout, Barbara Kreaseck, Paul D. H...