Algorithms
Measuring parallelism in algorithms
Euromicro 91 Proceedings of the seventeenth Euromicro conference on Software and hardware : specification and design: specification and design
Multiprocessor scheduling in a genetic paradigm
Parallel Computing
Scheduling Parallel Computations
Journal of the ACM (JACM)
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Graph Layout through the VCG Tool
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Towards a High-Level Machine Configuration System
LISA '94 Proceedings of the 8th USENIX conference on System administration
Adaptive Locks For Frequently Scheduled Tasks With Unpredictable Runtimes
LISA '97 Proceedings of the 11th USENIX conference on System administration
Theoretical System Administration
LISA '00 Proceedings of the 14th USENIX conference on System administration
The Maelstrom: Network Service Debugging via "Ineffective Procedures"
LISA '01 Proceedings of the 15th USENIX conference on System administration
The Maelstrom: Network Service Debugging via "Ineffective Procedures"
LISA '01 Proceedings of the 15th USENIX conference on System administration
Why Order Matters: Turing Equivalence in Automated Systems Administration
LISA '02 Proceedings of the 16th USENIX conference on System administration
Seeking Closure in an Open World: A Behavioral Agent Approach to Configuration Management
LISA '03 Proceedings of the 17th USENIX conference on System administration
Experience in Implementing an HTTP Service Closure
LISA '04 Proceedings of the 18th USENIX conference on System administration
Hi-index | 0.00 |
Automatic configuration management involves maintaining a set of shared and distributed resources in such a way that they serve a community of users fairly, promptly and reliably. In this context, this paper discusses experiments that measure the effect of adding randomized scheduling of partially ordered events to configuration management tools. Three characteristics of randomized scheduling are investigated: efficiency, robustness and security. A configuration management process is efficient if it minimizes the use of resources. It is robust if it is not vulnerable to malicious acts or inadvertent human errors. It is secure if its management model is hidden from observers. Several experiments suggest that randomized scheduling of partially ordered events has advantages over commonly used deterministic strategies, on average producing more efficient schedules. Further, randomized scheduling greatly degrades the accuracy of observer predictions of future behavior. In addition, randomized scheduling obscures the management model such that an observer will have to make a large number of observations in order to obtain the complete management model. The results of the study support the use of randomization in automatic configuration management tools.