Static vs. Dynamic List-Scheduling Performance Comparison
نویسندگان
چکیده
منابع مشابه
Static vs Dynamic SAGAs
Computing systems are becoming more and more complex, composed by a huge number of components interacting in different ways. Also, interactions are frequently loosely-coupled, in the sense that each component has scarce information on its communication partners, which may be unreliable (e.g., they may disconnect, or may not follow the expected protocol). Communication may be unreliable too, for...
متن کاملDynamic vs . Static Quantum -
This paper improves upon previous synthetic workload models and compares the performance of dynamic spatial equipartitioning (EQS) and the semi-static quantum-based FB-PWS processor allocation deened in 23], under synthetic workloads that have not previously been considered. These new workloads include realistic repartitioning overheads and job characteristics that are consistent with system me...
متن کاملDynamic Fractional Resource Scheduling vs. Batch Scheduling
We propose a novel job scheduling approach for homogeneous cluster computing platforms. Its key feature is the use of virtual machine technology to share fractional node resources in a precise and controlled manner. Other VM-based scheduling approaches have focused primarily on technical issues or on extensions to existing batch scheduling systems, while we take a more aggressive approach and s...
متن کاملPerformance Comparison of Locking Caches under Static and Dynamic Schedulers
Static use of locking caches is a useful solution to take advantage of cache memories in real-time systems. Locking cache operates preloading and locking a set of instructions, thus cache contents are a-priori known and remain unchanged during system operation. This solution eliminates the unpredictable behavior of conventional caches, making easy to accomplish the schedulability test through s...
متن کاملStatic-List Time-Constrained Scheduling Based On Topological Clustering
Static-list scheduling algorithms are constructive heuristics with a low complexity and highly useful for design space exploration. In this paper, we present a static-list scheduling algorithm that incorporates a novel topological clustering heuristic. Based on the clustering heuristic, we have developed a simple operation selection function and a combination of two cost functions to determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica
سال: 2003
ISSN: 1805-2363,1210-2709
DOI: 10.14311/490