Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Entire DC Network
A Study Of Monge Matrices With Applications To Scheduling, Revanth Pamballa
A Study Of Monge Matrices With Applications To Scheduling, Revanth Pamballa
UNLV Retrospective Theses & Dissertations
In this study of Monge properties I summarize a few aspects of the rich material based on these properties. Monge properties are related to the theory of convexity and just as convexity is important in classical Mathematics so is the theory of Monge properties important in Computer Science. In this thesis I will summarize a few aspects of Monge properties. I compare some of the different properties and show how that they all go back to Gaspard Monge's original ideas. I will highlight a number of new results in scheduling and show how Monge properties and Monge-like properties play a …
Scheduling Of Real Time Embedded Systems For Resource And Energy Minimization By Voltage Scaling, Naveen Babu Anne
Scheduling Of Real Time Embedded Systems For Resource And Energy Minimization By Voltage Scaling, Naveen Babu Anne
UNLV Retrospective Theses & Dissertations
The aspects of real-time embedded computing are explored with the focus on novel real-time scheduling policies, which would be appropriate for low-power devices. To consider real-time deadlines with pre-emptive scheduling policies will require the investigation of intelligent scheduling heuristics. These aspects for various other RTES models like Multiple processor system, Dynamic Voltage Scaling and Dynamic scheduling are the focus of this thesis. Deadline based scheduling of task graphs representative of real time systems is performed on a multiprocessor system; A set of aperiodic, dependent tasks in the form of a task graph are taken as the input and all the …
Flow Shop Scheduling With Two Machines, V. L. Kumar Adusumilli
Flow Shop Scheduling With Two Machines, V. L. Kumar Adusumilli
UNLV Retrospective Theses & Dissertations
A flow shop problem has n jobs (i = 1.. , n) on m machines (j = 1, . . . , m) and a job consists two operations and the jth operation of each job must be processed on machine j. Any job can start only on machine j if it is completed on machine j-1 and if machine j is free. Each operation has a known processing time pij. The work here focuses on the case m = 2 where the objective is to minimize (1) the makespan (Cmax) and (2) the average completion time (sumCi); We first …
Scheduling And Partitioning Vlsi Circuit Operating At Multiple Supply Voltages, Ling Wang
Scheduling And Partitioning Vlsi Circuit Operating At Multiple Supply Voltages, Ling Wang
UNLV Retrospective Theses & Dissertations
With today's increasingly large and complex digital integrated circuit (IC) and system-on-chip designs, power dissipation has emerged as a primary design consideration. Reduction of power consumption in VLSI designs can be achieved at various levels of the design hierarchy, ranging from processing technology, circuit, logic, architectural and algorithmic (behavioral) levels, up to system level. It has also been long recognized that the most dramatic power saving is achievable at the algorithm and architecture levels, where computations are normally described using data/control flow graph. Thus, in this thesis, a multiple supply voltage IC is synthesized at the behavior level; There are, …
Optimal Scheduling Of Thermal Generating Units In Electric Power Systems, Narsimha Misra
Optimal Scheduling Of Thermal Generating Units In Electric Power Systems, Narsimha Misra
UNLV Retrospective Theses & Dissertations
The Unit Commitment Problem (UCP) in electric power system problem that consists of finding the startup and shutdown schedule of generating units over a period of time (e.g., 24 hrs) so that the operating cost is minimized; The UCP is often characterized by its prohibitive computational time and memory space requirement. The thesis investigates some computational aspects of the problem in an effort to improve the CPU time as well as the quality of the solution. Two algorithms that show significant improvement over existing methods are presented: One is based on the dynamic programming approach and designed for implementation on …
A Programmatic And Scheduling Needs Assessment For The University Of Nevada, Las Vegas, Francis Xavier Brown
A Programmatic And Scheduling Needs Assessment For The University Of Nevada, Las Vegas, Francis Xavier Brown
UNLV Retrospective Theses & Dissertations
The purpose of this study was to examine the perceptions of external communities toward the programs and scheduling of the University of Nevada, Las Vegas. Clark County, Nevada was the metropolitan area studied. The county included only one full service university. The area was isolated from other full service institutions and was a nontraditional area that maintained a 24-hour work schedule. A county-wide school district operated many elementary schools on a 12-month schedule. A major Air Force base was present whose work hours conflicted with traditional university teaching hours; Surveys were taken from three groups. They were the Clark County …