Digital Commons Network^™

The Pulled-Macro-Dataflow Model: An Execution Model For Multicore Shared-Memory Computers, Daniel Joseph Richins

Theses and Dissertations

The macro-dataflow model of execution has been used in scheduling heuristics for directed acyclic graphs. Since this model was developed for the scheduling of parallel applications on distributed computing systems, it is inadequate when applied to the multicore shared-memory computers prevalent in the market today. The pulled-macro-dataflow model is put forth as an alternative to the macro-dataflow model, having been designed specifically to accurately describe the memory bandwidth limitations and request-driven nature of communications characteristic of today's machines. The performance of the common scheduling heuristics DSC and CASS-II are evaluated under the pulled-macro-dataflow model and it is shown that their …

Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr.

Doctoral Theses

Wireless ad hoc networking is an upcoming communication technology that makes exchange of information possible without any pre-existing infrastructure. Over the last decade it has grabbed tremendous interest in the research community due to its easy deployability and high flexibility, with numerous applications to social, industrial and personal uses. In this thesis, we designed effcient light weight distributed algorithms based on minimal local information to resolve the problems related to the initialization and topology configuration of wireless ad hoc networks with special emphasis on optimal utilization of limited resources. Once the ad hoc nodes with in-built radio transceivers are deployed …

Modeling The Homeschool Timetabling Problem Using Integer Programming, Subhashini Srinivasan

Theses and Dissertations

Home schooling has steadily been increasing in the past decade. According to a survey in 2007, about 2.5 million children were being home schooled in the US. Typically, parents provide education at the convenience of their home and in some cases an instructor is appointed for the same. The Home School Timetabling problem (HSTP) deals with assigning subjects, timeslots and rooms to every student. In doing so, there are certain hard and specialty constraints that are to be satisfied. Integer programming (IP) has been used in solving the HSTP as it has the advantage of being able to provide information …

The Effect Of Scheduling Models For Introductory Algebra On 9th-Grade Students, Test Scores And Grades, Angela L. O'Hanlon

Student Work

The purpose of the study was to determine the effect of pacing and scheduling of algebra coursework on assigned 9th-grade students who traditionally would qualify for pre-algebra instruction and same course 9th-grade students who traditionally would qualify for standard algebra instruction. Students were selected based on completion of first-year algebra by the end of their 9th-grade year. This study will compare all students’ math EXPLORE test scores, PLAN test scores, algebra common summative assessments (CSAs), geometry CSAs, fall grade point averages (GPAs) and spring GPAs.

Scheduling Procedures For A Family Practice Doctor's Office., Gabriel Barron

Electronic Theses and Dissertations

In order to allow quality healthcare to be available to more people, healthcare must be as affordable as possible. Ideally this will be done through the elimination of the waste that is built into the current healthcare system. One area that is ready for waste reduction is the manner in which family practice doctors’ offices and hospitals schedule patients. Despite hospitals being incredibly sophisticated and employing very intelligent individuals, their scheduling is often very old fashioned and does not take into account walk-in patients or no-show patients. Fortunately, some more advanced scheduling methods have been developed. One of these scheduling …

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez

Engineering Management & Systems Engineering Theses & Dissertations

The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan

Engineering Management & Systems Engineering Theses & Dissertations

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the …

Probabilistic Models For Patient Scheduling, Adel Alaeddini

Wayne State University Theses

In spite of the success of theoretical appointment scheduling methods, there have been significant failures in practice primarily due to the rapid increase in the number of no-shows and cancelations from the individuals in recent times. These disruptions not only cause inconvenience to the management but also has a significant impact on the revenue, cost and resource utilization. In this research, we develop a hybrid probabilistic model based on logistic regression and Bayesian inference to predict the probability of no-shows in real-time. We also develop two novel non-sequential and sequential optimization models which can effectively use no-show probabilities for scheduling …

Optimal Advertisement Scheduling In Breaks Of Random Lengths, Ajay Srinivasan Aravamudhan

Dissertations and Theses Collection (Open Access)

Broadcasters generate a large part of their revenue through advertising, especially in live sports. Scheduling advertisements can be challenging in live broadcasting, however, for sports such as Cricket that have breaks of random lengths and number during which the ads are shown. This uncertainty, coupled with the high price of spots for major competitions, means that improving ad scheduling can add significant value to the broadcaster. This problem shares similarities with the stochastic cutting stock problem and the dynamic stochastic knapsack problem, with applications in the wood, steel and paper industry and the transportation industry respectively.

This dissertation adds to …

Quality Of Service Based Data-Aware Scheduling, Archit Kulshrestha

LSU Doctoral Dissertations

Distributed supercomputers have been widely used for solving complex computational problems and modeling complex phenomena such as black holes, the environment, supply-chain economics, etc. In this work we analyze the use of these distributed supercomputers for time sensitive data-driven applications. We present the scheduling challenges involved in running deadline sensitive applications on shared distributed supercomputers running large parallel jobs and introduce a ``data-aware'' scheduling paradigm that overcomes these challenges by making use of Quality of Service classes for running applications on shared resources. We evaluate the new data-aware scheduling paradigm using an event-driven hurricane simulation framework which attempts to run …

Integrating Multiple Clusters For Compute-Intensive Applications, Zhifeng Yun

LSU Doctoral Dissertations

Multicluster grids provide one promising solution to satisfying the growing computational demands of compute-intensive applications. However, it is challenging to seamlessly integrate all participating clusters in different domains into a single virtual computational platform. In order to fully utilize the capabilities of multicluster grids, computer scientists need to deal with the issue of joining together participating autonomic systems practically and efficiently to execute grid-enabled applications. Driven by several compute-intensive applications, this theses develops a multicluster grid management toolkit called Pelecanus to bridge the gap between user's needs and the system's heterogeneity. Application scientists will be able to conduct very large-scale …