This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how...
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...
Qin Yin, Justin Cappos, Andrew Baumann, Timothy Ro...
Abstract As distributed, networked computing systems become the dominant computing platform in a growing range of applications, they increase opportunities for security violations ...
Ali Mili, Frederick T. Sheldon, Lamia Labed Jilani...