Sciweavers

9325 search results - page 1421 / 1865
» The decentralized implementability problem
Sort
View
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 11 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
PEPM
1992
ACM
15 years 11 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
231
Voted
RTSS
1992
IEEE
15 years 11 months ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay
PLDI
1990
ACM
15 years 11 months ago
Representing Control in the Presence of First-Class Continuations
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
Robert Hieb, R. Kent Dybvig, Carl Bruggeman
VLDB
1990
ACM
80views Database» more  VLDB 1990»
15 years 11 months ago
Performance Analysis of Disk Arrays under Failure
Disk arrays (RAID) have been proposed as a possible approach to solving the emerging I/O bottleneck problem. The performance of a RAID system when all disks are operational and th...
Richard R. Muntz, John C. S. Lui
« Prev « First page 1421 / 1865 Last » Next »