Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 109 for “"schedulers"”.
-
Distributed dispatchers for partially clairvoyant schedulers
This work focuses on the empirical evaluation of distributed dispatching strategies on shared and distributed memory architectures for hard real-time systems. The dispatching model accommodates process parameter variability and analyzes the effect of variable execution times.;Hard real-time systems …
-
A study of covert queueing channels in shared schedulers
We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user modulates messages to another user via his pattern of access to the shared resource. One example of such a channel …
-
Optimality of Heuristic Schedulers in Utility Accrual Real-time Scheduling Environments
… based on a utility function. The goal of such schedulers is to use a best-effort approach to maximize the utility function and ensure graceful degradation at overloads. Utility Accrual (UA) schedulers use heuristics to maximize the accrued utility. Heuristic-based scheduling do not always yield …
-
Scheduling real-time messages in packet-switched networks
… resources at that node. In an ideal case, the schedulers are completely independent, and the well-known scheduling and analysis techniques developed for single-node systems can be used, thus greatly simplifying the real-time network design. However the use of independent schedulers may lead to …
-
Optimizing work stealing algorithms with scheduling constraints
… popularity in conjunction with work-stealing schedulers. Random work-stealing schedulers have been shown to effectively perform dynamic load balancing, yielding provably-efficient schedules and space bounds on shared-memory architectures with uniform memory models. However, the advent of …
-
On Intelligent Mitigation of Process Starvation In Multilevel Feedback Queue Scheduling
<p>CPU time-share process schedulers for computer operating systems have existed since Corbato published his paper on the Compatible Time Sharing System in 1962 [8]. With this new type of scheduler came the need to effectively divide CPU time between N processes, where N could be 2 or more …
-
A streaming computation framework for the Cell Processor
… framework. The programmability of high-level schedulers with and without the library is analyzed. We observe that the library does not add significant overhead, provides a number of useful features for schedulers, and greatly simplifies the code required to implement schedulers.
-
Cross-layer scheduling in cloud computing systems
Today, application schedulers are decoupled from routing level schedulers, leading to sub-optimal throughput for cloud computing platforms. In this thesis, we propose a cross-layer scheduling framework that bridges the application level scheduler with the routing level scheduler (SDN). We realize …
-
Optimizing scheduling for stream structured programming for StreamIt
… interface that enables hardware customized schedulers to be developed quickly. The scheduler interface allows for schedulers to take advantage of the unique compiler optimizations enabled by StreamIt’s structure. Two schedulers, one search based and another heuristic based, are built using …
-
Application-Aware Scheduling Architectures for Mobile Systems
Architects of mobile systems have long optimized schedulers for platform-level objectives, such as system throughput or operating cost. However, these objectives could be at odds with performance indicators that applications or users of the platform might care about. This thesis proposes two-tiered …
-
Flexible and efficient computation in large data centres
… workflows are either placed by high-quality schedulers that avoid co-location interference, but choose placements slowly, or schedulers that choose placements quickly, but with unpredictable workflow run time due to co-location interference. In this dissertation, I show that schedulers can …
-
Monitoring, analysing and predicting network performance in grids
… network performance information to grid schedulers, allowing them to adapt to changes in the network. The contribution of this thesis is twofold: a novel approach to network measurement that is particularly suitable for grid environments; and a distributed system that collects and manages …
-
Optimizing Information Freshness in Wireless Networks
… in the state-of-the-art. First, we design schedulers to minimize AoI under more practical settings, including varying sampling periods, varying sample sizes, cellular transmission models, dynamic channel conditions, etc. Second, we design schedulers to guarantee hard or soft AoI deadlines …
-
Impact Of Thread Scheduling On Modern Gpus
… performance. We implement four different thread schedulers: Two-level wavefront scheduler, Lookahead wavefront scheduler and Two-level + Lookahead wavefront scheduler, and Block workgroup scheduler. We implement and test these schedulers on a cycle accurate detailed architectural simulator called …
-
Learned scheduling for database management systems
… We use existing training techniques for job schedulers with dependency constraints. However, the model is specialized for database workloads using features specific to database queries, such as node operator type. In addition, we represent pipelining scheduling opportunities between operator …
-
Efficient scheduling algorithms for quality-of-service guarantees in the Internet
… theme of this thesis is the design of packet schedulers to provide quality-of- service (QoS) guarantees for various networking problem settings. There is a dual emphasis on both theoretical justification and simulation evaluation. We have worked on several widely different problem settings - …
-
A Comparison of Alphanumeric, Direct Manipulation Graphic, and Equivalent Interface Design for a Production Scheduling Task
… scheduling. The results of the study show that schedulers monitor the current system state and preview to future system states to test scheduling options and make scheduling decisions. Thus, current state, goal state, future state, and discrepancy between goal state and future state information …
-
5G Scheduling for Distributed Control in Microgrids
… thesis compares the performance of AoI-based schedulers against standard schedulers. These different schedulers are then used on test systems employing distributed control.
-
Thread Scheduling For Chip Multiprocessors
… multithreaded programs. Operating system (OS) schedulers are unaware of these is- sues, and cannot create optimal schedules. We demonstrate how the OS and user-space programs can be made aware of these issues at run-time using hardware performance counters that already exist on chip. We …
-
COPS: A Framework for Consumer Oriented Proportional-share Scheduling
… performance. Most existing general-purpose schedulers use a priority-based scheme to schedule processes. Such priority-based mechanisms cannot guarantee proportional fairness for every process. Proportional share schedulers maintain fairness among tasks based on given weight values. In both …
Page 1 of 6