Sciweavers

3218 search results - page 361 / 644
» Timed Extensions for SDL
Sort
View
ECRTS
2005
IEEE
16 years 5 days ago
Cache Contents Selection for Statically-Locked Instruction Caches: An Algorithm Comparison
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Antonio Martí Campoy, Isabelle Puaut, Angel...
COCOON
2005
Springer
16 years 16 hour ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...
ATAL
2003
Springer
15 years 11 months ago
Coalition formation with uncertain heterogeneous information
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...
Sarit Kraus, Onn Shehory, Gilad Taase
VEE
2009
ACM
130views Virtualization» more  VEE 2009»
15 years 11 months ago
Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning
We present the design, implementation, and evaluation of post-copy based live migration for virtual machines (VMs) across a Gigabit LAN. Live migration is an indispensable feature...
Michael R. Hines, Kartik Gopalan
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas