Scheduling for today’s computer systems: bridging theory and practice

Scheduling is a fundamental technique for improving performance in computer systems. From web servers to routers to operating systems, how the bottleneck device is scheduled has an enormous impact on the performance of the system as a whole. Given the immense literature studying scheduling, it is easy to think that we already understand enough about scheduling. But, modern computer system designs have highlighted a number of disconnects between traditional analytic results and the needs of system designers. In particular, the idealized policies, metrics, and models used by analytic researchers do not match the policies, metrics, and scenarios that appear in real systems. The goal of this thesis is to take a step towards modernizing the theory of scheduling in order to provide results that apply to today’s computer systems, and thus ease the burden on system designers. To accomplish this goal, we provide new results that help to bridge each of the disconnects mentioned above. We will move beyond the study of idealized policies by introducing a new analytic framework where the focus is on scheduling heuristics and techniques rather than individual policies. By moving beyond the study of individual policies, our results apply to the complex hybrid policies that are often used in practice. For example, our results enable designers to understand how the policies that favor small job sizes are affected by the fact that real systems only have estimates of job sizes. In addition, we move beyond the study of mean response time and provide results characterizing the distribution of response time and the fairness of scheduling policies. These results allow us to understand how scheduling affects QoS guarantees and whether favoring small job sizes results in large job sizes being treated unfairly. Finally, we move beyond the simplified models traditionally used in scheduling research and provide results characterizing the effectiveness of scheduling in multiserver systems and when users are interactive. These results allow us to answer questions about the how to design multiserver systems and how to choose a workload generator when evaluating new scheduling designs

Hybrid token-CDMA MAC protocol for wireless networks.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2009.Ad hoc networks are commonly known to implement IEEE 802.11 standard as their medium access control (MAC) protocol. It is well known that token passing MAC schemes outperform carrier-sense-multiple-access (CSMA) schemes, therefore, token passing MAC protocols have gained popularity in recent years. In recent years, the research extends the concept of token passing ' scheme to wireless settings since they have the potential of achieving higher channel utilization than CSMA type schemes. In this thesis, a hybrid Token-CDMA MAC protocol that is based on a token passing scheme with the incorporation of code division multiple access (CDMA) is introduced. Using a dynamic code distribution algorithm and a modified leaky-bucket policing system, the hybrid protocol is able to provide both Quality of Service (QoS) and high network resource utilization, while ensuring the stability of a network. This thesis begins with the introduction of a new MAC protocol based on a token-passing strategy. The input traffic model used in the simulation is a two-state Markov Modulated Poisson Process (MMPP). The data rate QoS is enforced by implementing a modified leaky bucket mechanism in the proposed MAC scheme. The simulation also takes into account channel link errors caused by the wireless link by implementing a multi-layered Gilbert-Elliot model. The performance of the proposed MAC scheme is examined by simulation, and compared to the performance of other MAC protocols published in the literature. Simulation results demonstrate that the proposed hybrid MAC scheme is effective in decreasing packet delay and significantly shortens the length of the queue. The thesis continues with the discussion of the analytical model for the hybrid Token CDMA protocol. The proposed MAC scheme is analytically modelled as a multiserver multiqueue (MSMQ) system with a gated service discipline. The analytical model is categorized into three sections viz. the vacation model, the input model and the buffer model. The throughput and delay performance are then computed and shown to closely match the simulation results. Lastly, cross-layer optimization between the physical (PHY) and MAC layers for the hybrid token-CDMA scheme is discussed. The proposed joint PHY -MAC approach is based on the interaction between the two layers in order to enable the stations to dynamically adjust the transmission parameters resulting in reduced mutual interference and optimum system performance

Resource allocation and optimal release time in software systems

Software quality is directly correlated with the number of defects in software systems. As the complexity of software increases, manual inspection of software becomes prohibitively expensive. Thus, defect prediction is of paramount importance to project managers in allocating the limited resources effectively as well as providing many advantages such as the accurate estimation of project costs and schedules. This thesis addresses the issues of statistical fault prediction modeling, software resource allocation, and optimal software release and maintenance policy. A software defect prediction model using operating characteristic curves is presented. The main idea behind this predictor is to use geometric insight in helping construct an efficient prediction method to reliably predict the cumulative number of defects during the software development process. Motivated by the widely used concept of queue models in communication systems and information processing systems, a resource allocation model which answers managerial questions related to project status and scheduling is then introduced. Using the proposed allocation model, managers will be more certain about making resource allocation decisions as well as measuring the system reliability and the quality of service provided to customers in terms of the expected response time. Finally, a novel stochastic model is proposed to describe the cost behavior of the operation, and estimate the optimal time by minimizing a cost function via artificial neural networks. Further, a detailed analysis of software release time and maintenance decision is also presented. The performance of the proposed approaches is validated on real data from actual SAP projects, and the experimental results demonstrate a compelling motivation for improved software qualit