Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

Scheduling

Institution
Publication Year
Publication
Publication Type
File Type

Articles 31 - 42 of 42

Full-Text Articles in Engineering

A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver May 2009

A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Increased levels of science objectives expected from spacecraft systems necessitate the ability to carry out fast on-board autonomous mission planning and scheduling. Heterogeneous radiation-hardened Field Programmable Gate Arrays (FPGAs) with embedded multiplier and memory modules are well suited to support the acceleration of scheduling algorithms. A methodology to design circuits specifically to accelerate Simulated Annealing Kernels (SAKs) in event scheduling algorithms is shown. The main contribution of this thesis is the low complexity scoring calculation used for the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different …

Go to article

Comparison Of De And Pso For Generator Maintenance Scheduling, Yusuf Yare, Ganesh K. Venayagamoorthy Sep 2008

Comparison Of De And Pso For Generator Maintenance Scheduling, Yusuf Yare, Ganesh K. Venayagamoorthy

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a comparison of a differential evolution (DE) algorithm and a modified discrete particle swarm optimization (MDPSO) algorithm for generating optimal preventive maintenance schedules for economical and reliable operation of a power system, while satisfying system load demand and crew constraints. The DE, an evolutionary technique and an optimization algorithm utilizes the differential information to guide its further search, and can handle mixed integer discrete continuous optimization problems. Discrete particle swarm optimization (DPSO) is known to effectively solve large scale multi-objective optimization problems and has been widely applied in power systems. Both the DE and MDPSO are applied …

Go to article

Optimal Scheduling Of Generator Maintenance Using Modified Discrete Particle Swarm Optimization, Yusuf Yare, Ganesh K. Venayagamoorthy Aug 2007

Optimal Scheduling Of Generator Maintenance Using Modified Discrete Particle Swarm Optimization, Yusuf Yare, Ganesh K. Venayagamoorthy

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a modified discrete particle swarm optimization (PSO) based technique for generating optimal preventive maintenance schedule of generating units for economical and reliable operation of a power system while satisfying system load demand and crew constraints. While GA and other analytical methods might suffer from premature convergence and the curse of dimensionality, heuristics based swarm intelligence can be an efficient alternative. PSO is known to effectively solve large scale multi-objective optimization problems. Here, a modified discrete PSO approach is proposed for the GMS optimization problem in order to overcome the limitations of the conventional methods and come up …

Go to article

Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang Jan 2007

Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang

University of Kentucky Doctoral Dissertations

Energy consumption is increasingly affecting battery life and cooling for real- time systems. Dynamic Voltage and frequency Scaling (DVS) has been shown to substantially reduce the energy consumption of uniprocessor real-time systems. It is worthwhile to extend the efficient DVS scheduling algorithms to distributed system with dependent tasks. The dissertation describes how to extend several effective uniprocessor DVS schedul- ing algorithms to distributed system with dependent task set. Task assignment and deadline assignment heuristics are proposed and compared with existing heuristics concerning energy-conserving performance. An admission test and a deadline com- putation algorithm are presented in the dissertation for dynamic …

Go to article

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu Jul 2006

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu

Electrical & Computer Engineering Theses & Dissertations

Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …

Go to article

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem Jan 2006

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …

Go to article

Power And Memory Optimization Techniques In Embedded Systems Design, Atef Khalil Allam Jan 2005

Power And Memory Optimization Techniques In Embedded Systems Design, Atef Khalil Allam

LSU Doctoral Dissertations

Embedded systems incur tight constraints on power consumption and memory (which impacts size) in addition to other constraints such as weight and cost. This dissertation addresses two key factors in embedded system design, namely minimization of power consumption and memory requirement. The first part of this dissertation considers the problem of optimizing power consumption (peak power as well as average power) in high-level synthesis (HLS). The second part deals with memory usage optimization mainly targeting a restricted class of computations expressed as loops accessing large data arrays that arises in scientific computing such as the coupled cluster and configuration interaction …

Go to article

Evaluating The Repair Of System-On-Chip (Soc) Using Connectivity, Minsu Choi, Nohpill Park, Vincenzo Piuri, Fabrizio Lombardi Dec 2004

Evaluating The Repair Of System-On-Chip (Soc) Using Connectivity, Minsu Choi, Nohpill Park, Vincenzo Piuri, Fabrizio Lombardi

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a new model for analyzing the repairability of reconfigurable system-on-chip (RSoC) instrumentation with the repair process. It exploits the connectivity of the interconnected cores in which unreliability factors due to both neighboring cores and the interconnect structure are taken into account. Based on the connectivity, two RSoC repair scheduling strategies, Minimum Number of Interconnections First (I-MIN) and Minimum Number of Neighboring Cores First (C-MIN), are proposed. Two other scheduling strategies, Maximum Number of Interconnections First (I-MAX) and Maximum Number of Neighboring cores First (C-MAX), are also introduced and analyzed to further explore the impact of connectivity-based repair …

Go to article

Robust Resource Allocation For Sensor-Actuator Distributed Computing Systems, Shoukat Ali, Jong-Kook Kim, A. A. Maciejewski, Howard Jay Siegel Jan 2004

Robust Resource Allocation For Sensor-Actuator Distributed Computing Systems, Shoukat Ali, Jong-Kook Kim, A. A. Maciejewski, Howard Jay Siegel

Electrical and Computer Engineering Faculty Research & Creative Works

This research investigates two distinct issues related to a resource allocation: its robustness and the failure rate of the heuristic used to determine the allocation. The target system consists of a number of sensors feeding a set of heterogeneous applications continuously executing on a set of heterogeneous machines connected together by high-speed heterogeneous links. There are number of quality of service (QoS) constraints that must be satisfied. A heuristic failure occurs if the heuristic cannot find an allocation that allows the system to meet its QoS constraints. The system is expected to operate in an uncertain environment where the workload, …

Go to article

Application Of Tabu Search Algorithm In Job Shop Scheduling, Betrianis Betrianis, Putu Teguh Aryawan Dec 2003

Application Of Tabu Search Algorithm In Job Shop Scheduling, Betrianis Betrianis, Putu Teguh Aryawan

Makara Journal of Technology

Application of Tabu Search Algorithm in Job Shop Scheduling. Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard), ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three) cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax). …

Go to article

Security-Constrained Optimal Rescheduling Of Real Power Using Hopfield Neural Network, S. Ghosh, Badrul H. Chowdhury Jan 1996

Security-Constrained Optimal Rescheduling Of Real Power Using Hopfield Neural Network, S. Ghosh, Badrul H. Chowdhury

Electrical and Computer Engineering Faculty Research & Creative Works

A new method for security-constrained corrective rescheduling of real power using the Hopfield neural network is presented. The proposed method is based on solution of a set of differential equations obtained from transformation of an energy function. Results from this work are compared with the results from a method based on dual linear programming formulation of the optimal corrective rescheduling. The minimum deviations in real power generations and loads at buses are combined to form the objective function for optimization. Inclusion of inequality constraints on active line flow limits and equality constraint on real power generation load balance assures a …

Go to article

Two-Step Optimal Thermal Generation Scheduling, B Fardanesh, F. Eugenio Villaseca May 1986

Two-Step Optimal Thermal Generation Scheduling, B Fardanesh, F. Eugenio Villaseca

Electrical and Computer Engineering Faculty Publications

A new approach to the solution of the optimal thermal generation scheduling problem is presented. The problem is solved in two steps. As a first step, the optimal production schedule for the next day is obtained based on a daily load forecast, reserve capacity requirements, and present status of generating units. The second-step algorithm uses the results of the first step and adjusts the previous schedule to meet new constraints developed during the course of the day. Variable truncation dynamic programming is proposed as a new method to reduce computation effort. To eliminate the need for solving the …

Go to article

First Prev