Sciweavers

359 search results - page 32 / 72
» On Complete Primitives for Fairness
Sort
View
CPC
2007
97views more  CPC 2007»
13 years 11 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
SIGOPS
2008
145views more  SIGOPS 2008»
13 years 10 months ago
Towards distributed storage resource management using flow control
Deployment of shared storage systems is increasing with rapid adoption of virtualization technologies to provide isolation, better management and high utilization of resources. Qu...
Ajay Gulati, Irfan Ahmad
JSW
2007
96views more  JSW 2007»
13 years 10 months ago
Dynamic Scheduling of Skippable Periodic Tasks: Issues and Proposals
Abstract— This paper deals with dynamic scheduling in realtime systems that have Quality of Service requirements. We assume that tasks are periodic and may miss their deadlines, ...
Maryline Silly-Chetto, Audrey Marchand
ACSAC
2007
IEEE
14 years 5 months ago
Quarantining Untrusted Entities: Dynamic Sandboxing Using LEAP
Jails, Sandboxes and other isolation mechanisms limit the damage from untrusted programs by reducing a process’s privileges to the minimum. Sandboxing is designed to thwart such...
Manigandan Radhakrishnan, Jon A. Solworth
ICFP
2005
ACM
14 years 10 months ago
AtomCaml: first-class atomicity via rollback
We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A fir...
Michael F. Ringenburg, Dan Grossman