Performance Evaluation Of Scheduling Research Articles

무선 메쉬 네트워크의 최대 전송 성능을 위한 라우팅과 스케쥴링의 계층 교차적 설계 및 성능 분석

최근 유비쿼터스 컴퓨팅 환경과 광대역 접속 환경을 필요로 하는 멀티미디어 어플리케이션 사용자가 급속히 증가하고 있으며, 이들에게 효율적인 네트워크 서비스를 제공할 수 있는 차세대 무선 네트워킹을 위한 핵심기술로서 무선 메쉬 네트워크가 주목받고 있다. 다수의 네트워크의 플로우들이 동시에 전송되는 경우, 각 플로우들의 경로 설정을 위한 경로 탐색과 각 플로우들의 전송을 위한 링크의 자원 할당은 네트워크의 효율성에 직접적으로 영향을 주는 요소 중 하나이다. 본 논문에서는 STDMA 기반의 무선 메쉬 네트워크에서 수리적 모델링을 사용하여 경로 탐색과 링크의 자원할당 문제를 동시에 고려하여 주어진 각 플로우들의 전송률을 최대로 수용할 수 있는 계층간 최적화 설계 기법을 이용한 알고리즘을 제안한다. 그리고, 성능분석을 통하여 제안한 알고리즘이 다중 홉 무선 메쉬 네트워크를 경유하는 플로우들의 수가 늘어날 때 주어진 대역폭 자원을 최대로 활용하여 전송 성능을 향상 시킬 수 있음을 보였다.

Optimal Scheduling of Flowshop Batch Process for Zero-Wait and No Intermediate Storage Transfer Policy

The scheduling zero-wait (ZW) and no intermediate storage transfer (NIS) policy of multi-product batch processes in order to produce a number of low volume high value-added chemical products because of its economic impact. It involves various parameters such as makespan (completion time) which is recognized as one of the important design parameter as it helps to decide for the best scheduling design and normally used as the main parameter for selecting the optimal production sequence which involves various parameters such as batch process recipes, sequence of production and transfer policy for product intermediates. In this paper, we present a development, solution and computational performance evaluation of optimal scheduling for multiproduct batch process with two commonly used transfer policies namely zero wait (ZW) and no intermediate storage (NIS) by using computer program language software (Java) which simplify and improve the determination of Makespan and select the optimum sequence due to the minimum Makespan.

Workload resampling for performance evaluation of parallel job schedulers

SUMMARYEvaluating the performance of a computer system is based on using representative workloads. Common practice is to either use real workload traces to drive simulations or use statistical workload models that are based on such traces. Such models allow various workload attributes to be manipulated, thus providing desirable flexibility, but may lose details of the workload's internal structure. To overcome this, we suggest to combine the benefits of real traces and flexible modeling. Focusing on the problem of evaluating the performance of parallel job schedulers, we partition the trace of submitted jobs into independent subtraces representing different users and then recombine them in various ways, while maintaining features such as long‐range dependence and the daily and weekly cycles of activity. This facilitates the creation of longer workload traces that enable longer simulations, the creation of multiple statistically similar workloads that can be used to gauge confidence intervals, the creation of workloads with different load levels, and increasing the frequency of specific events like large surges of activity. Copyright © 2014 John Wiley & Sons, Ltd.

Scheduling Performance Evaluation of Logistics Service Supply Chain Based on the Dynamic Index Weight

Scheduling is crucial to the operation of logistics service supply chain (LSSC), so scientific performance evaluation method is required to evaluate the scheduling performance. Different from general project performance evaluation, scheduling activities are usually continuous and multiperiod. Therefore, the weight of scheduling performance evaluation index is not unchanged, but dynamically varied. In this paper, the factors that influence the scheduling performance are analyzed in three levels which are strategic environment, operating process, and scheduling results. Based on these three levels, the scheduling performance evaluation index system of LSSC is established. In all, a new performance evaluation method proposed based on dynamic index weight will have three innovation points. Firstly, a multiphase dynamic interaction method is introduced to improve the quality of quantification. Secondly, due to the large quantity of second-level indexes and the requirements of dynamic weight adjustment, the maximum attribute deviation method is introduced to determine weight of second-level indexes, which can remove the uncertainty of subjective factors. Thirdly, an adjustment coefficient method based on set-valued statistics is introduced to determine the first-level indexes weight. In the end, an application example from a logistics company in China is given to illustrate the effectiveness of the proposed method.

Performance Evaluation of an Energy-Efficient MAC Scheduler by using a Test Bed Approach

A Wireless Sensor Network consists of a large number of sensor nodes that are usually battery powered and deployed in large areas in which changing or recharging batteries may be impractical or completely unfeasible. Therefore, energy efficiency represents one of the main design objectives for these networks. Since most of the energy is consumed by the radio communication, the development of Medium Access Control protocols able to minimize the radio energy consumption is a very attractive research area. This paper presents an energy efficient communication protocol and its implementation in the Contiki Operating System. The performances and the portability of the proposed solution are thoroughly evaluated by means of both simulations, carried out using the Contiki simulation tools (i.e., Cooja and MPSim), and test beds based on two different platforms. Obtained results show that the proposed scheme significantly reduces the sensor nodes power consumption compared to the IEEE 802.15.4 standard solution already implemented in Contiki.

On the Performance Evaluation of Energy-Aware Sleep Scheduling (EASS) in Energy Harvesting WSN (EH-WSN)

Tree-based structures offer assured optimal paths from the data source to the sink. Shortest routes are disregarded since these do not consider the remaining energy level of the nodes. This shortens the lifetime of the whole network. Most tree-based routing protocols, although aware of the nodes’ energy, do not consider an energy aware sleep scheduling scheme. We propose an energy-aware sleep scheduling (EASS) scheme that will improve the sleep scheduling scheme of an existing treebased routing protocol. An energy harvesting structure will be implemented on the wireless sensor network. The depth of sleep of every node will be based on the harvested energy.

A Tag Machine Based Performance Evaluation Method for Job-Shop Schedules

This paper proposes a methodology for performance evaluation of schedules for job-shops modeled using tag machines. The most general tag structure for capturing dependences is shown to be inadequate for the task. A new tag structure is proposed. Comparison of the method with existing ones reveals that the proposed method has no dependence on schedule length in terms of modeling efficiency and it shares the same order of complexity with existing approaches. The proposed method, however, is shown to bear promise of applicability to other models of computation and hence to heterogeneous system models having such constituent models.

Empirical performance evaluation of schedulers for cluster of workstations

Cluster computing is receiving exponential popularity as a choice for high performance computing. This is mainly due to its effective cost performance ratio. Resource management systems (RMS) are the key component to manage the resources of clusters efficiently and have a very vital role in the performance of distributed parallel systems especially a job scheduling module. In this paper, we have empirically evaluated four resource management systems (SGE, TORQUE, and MAUI Scheduler and SLURM) with special focus on job scheduler component. These schedulers have been evaluated on a more comprehensive set of metrics such as throughput, CPU, memory and network utilization. Experiments were carried out on three different size testbeds with a range of scheduler configurations such as FCFS, Backfilling, Fair share and SJF scheduling techniques. A head-to-head comparison of different scheduling techniques has also been presented which highlights the effect of RMS on the performance of scheduling techniques. It has been observed from results that relative difference among the performance of scheduling techniques reached up to 63%. We conclude from the experiments that there is no single choice of RMS which can be identified as the best but SLURM performs better than others in most of the cases.

A Study of Operating Room Scheduling That Integrates Multiple Quantitative and Qualitative Objectives

Most operating room (OR) scheduling is done by scheduling personnel based on experience or heuristics. Such often results in excessive overtime for medical personnel and poor resource-use efficiencies. This study was designed to employ an integrated OR scheduling performance evaluation model (IOSPEM), which integrates quantitative and qualitative multiple objectives, to the improvement of OR scheduling quality. The fuzzy Delphi method was used to obtain the weight values of time factor, cost factor, and risk factor. The fuzzy set theory was applied to transform qualitative risk measures into quantitative values. The desirability function was utilized to integrate time, cost, and risk factors to develop the IOSPEM. The simulated annealing algorithm was used to develop the scheduling system and test proposed model performance. The proposed IOSPEM successfully integrated the quantitative and qualitative indices into a sole quantitative index. Experiment results show that the IOSPEM incorporating the simulated annealing algorithm is able to obtain the most efficient OR schedule and is helpful in reducing costs and fatigue risks. Operating room scheduling will be made more objective and efficient if OR scheduling personnel can simultaneously consider the cost, fatigue risk, and other factors in scheduling. Cost of each OR room should be considered to set appropriate cost coefficients in practical application of the IOSPEM. It is also suggested that other indices (e.g., OR overtime costs and OR nurse fatigue risks) also be considered in the proposed model so as to better reflect the actual scheduling environment. The procedure and methods implemented in this study may be used as the basis for further developing more effective and efficient OR scheduling systems.

A Survey on Scheduling in IEEE 802.16 Mesh Mode

IEEE 802.16 standard (also known as WiMAX) defines the wireless broadband network technology which aims to solve the so called last mile problem via providing high bandwidth Internet even to the rural areas for which the cable deployment is very costly. The standard mainly focuses on the MAC and PHY layer issues, supporting two transmission modes: PMP (Point-to-Multipoint) and mesh modes. Mesh mode is an optional mode developed as an extension to PMP mode and it has the advantage of having an improving performance as more subscribers are added to the system using multi-hop routes. In 802.16 MAC protocol, mesh mode slot allocation and reservation mechanisms are left open which makes this topic a hot research area. Hence, the focus of this survey will mostly be on the mesh mode, and the proposed scheduling algorithms and performance evaluation methods.

Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.

Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks

IEEE 802.16 employs TDMA (Time Division Multiple Access) as the access method and the policy for selecting scheduled links in a given time slot will definitely impact the system performance. We propose a collision-free centralized scheduling algorithm for IEEE 802.16 based Wireless Mesh Networks (WMN) to provide high-quality wireless multimedia services. We design a relay strategy for the mesh nodes in a transmission tree, taking special considerations on fairness, channel utilization and transmission delay. We evaluated the proposed algorithm with four selection criteria through extensive simulations and the experimental results are instrumental for improving the performance of IEEE 802.16 based WMNs in terms of link scheduling. To the best of the authors’ knowledge, this work is the first one on the centralized scheduling for IEEE 802.16 mesh mode that considers the relay model.

A performance evaluation of permutation vs. non-permutation schedules in a flowshop

It has been pointed out that a permutation schedule can be improved by a non-permutation schedule in a flowshop with completion-time based criteria, but there is a lack of comprehensive analyses. This paper presents an extensive computational investigation concerning the performance comparison between permutation and non-permutation schedules. The computational results indicate that in general, there is little improvement made by non-permutation schedules over permutation schedules with respect to completion-time based criteria. But the improvement is significant with respect to due-date based criteria, including total tardiness and total weighted tardiness. The results provide practitioners a guideline as to when to adopt a non-permutation schedule, which may exhibit better performance but require additional computational and control efforts.

A Performance Evaluation of Multiprocessor Scheduling with Genetic Algorithm

An efficient assignment and scheduling of tasks of a multiprocessor program is one of the key elements in the effective utilization of multiprocessor systems. This problem being hard to solve exactly, is the reason that so many heuristic methods for finding a suboptimal schedule exist (Hou et al., 1994; Tsuchiya et al., 1997). This paper addresses the problem of multiprocessor scheduling represented as a directed acyclic task graph (DAG) without communication costs to fully connected multiprocessors. We proposed an algorithm, called PGA/SPF (Priority-based Genetic Algorithm/Shortest Processor First schedule) where a priority-based genetic algorithm is improved with the introduction of some knowledge about the scheduling problem, which is represented by the use of genetic operators as crossover and mutation operators. And, a new mapping method, shortest processor first schedule, assigns the selected task to a processor that can minimize a task execution time efficiently. The proposed algorithms generate similar or even better solutions than the previous algorithms in terms of the completion times of the resulting schedules.

Making Benchmark Problems for RCPSP/τ, and Quantitative Performance Evaluation of a General Project Scheduler

Making Benchmark Problems for RCPSP/τ, and Quantitative Performance Evaluation of a General Project Scheduler

Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective

The flowline-based manufacturing system (FBMS) is a manufacturing environment wherein machines are arranged in the order in which jobs undergo operations, and jobs have an identical and uni-directional flow pattern. However, some or all jobs may not require processing on some machines. Scheduling of jobs in such a FBMS is considered in this paper with the focus on the development of non-permutation schedules. The significance of non-permutation schedules in improving the schedule performance measures, in the context of FBMS’s, is first brought out. A heuristic procedure to derive non-permutation schedules from a given permutation schedule is subsequently proposed. The minimization of total flowtime of jobs is considered as the objective in the first instance, followed by the consideration of the minimization of total weighted flowtime of jobs. An extensive computational experimentation has been performed to evaluate the effectiveness of the proposed heuristic in improving the performance measures. Further, the performance of the proposed heuristic in generating non-permutation schedules has been compared with that of the benchmark dispatching rules namely, the SPT and SWPT rules.

Stochastic analysis and performance evaluation of wireless schedulers

AbstractIn the last few years, wireless scheduling algorithms have been proposed by supplementing wireline scheduling algorithms with a wireless adaptation scheme. However, Quality of Service (QoS) bounds have either been derived for flows that perceive error‐free conditions or a static worst‐case channel condition. Such an assumption of the channel condition is unrealistic, since channel errors are known to be bursty in nature. Hence, these bounds are inadequate to characterize the scheduler's QoS performance. Our research focuses on performing an extensive analysis of wireless scheduling in order to derive statistical QoS performance bounds under realistic channel conditions. In this paper, we develop stochastic models for various wireless schedulers. Based on these models, we define and evaluate statistical QoS performance metrics in terms of throughput, delay and fairness under various channel conditions and over different time scales. Numerical results indicate that no single scheduler outperforms the others in terms of all the QoS metrics under all channel conditions. The choice of an optimal scheduling mechanism depends on the priority of QoS requirements as well as the channel conditions. Copyright © 2004 John Wiley & Sons, Ltd.

Performance evaluation of optimal aggregate-flow scheduling: a simulation study

Providing scalable QoS-sensitive services to applications with varying degrees of elasticity using aggregate-flow scheduling is a challenging problem. In a previous paper [Proc. IEEE/IFIP Int. Workshop Quality Service (2000) 211], we advanced a theoretical framework where an optimal differentiated services provisioning problem is formulated and solved to yield solutions for optimal per-hop control. In this paper, we extend our previous work by investigating performance evaluation and implementation issues associated with the induced optimal differentiated services architecture. We design a system that realizes the optimal per-hop control coupled with end-to-end adaptive QoS control, and implement a practical enhancement by introducing a scaling function which is applied to the TOS field label value in the IP header at each router. The scaling function allows the service provider to configure the per-hop control so as to export customized QoS separation—essential when shaping end-to-end absolute QoS over per-hop relative QoS-commensurate with the QoS profiles of the service provider's user base. We use simulation to study the structural and dynamical properties of differentiated services as affected by optimal aggregate-flow per-hop control.

Performance Evaluation of Transaction Scheduling in Distributed Real-Time Database Systems

Two crucial issues in the schedulability of real-time transactions in a distributed environment are the predictability of the execution times of the transactions and the coexistence of hard, firm and soft real-time transactions. To-date, there are very few research studies which have addressed these two very important issues. In the present study. the model of a distributed real-time database system has been implemented to evaluate a new transaction scheduling scheme to handle problems relating to the two issues. Simulation results indicated that using different scheduling algorithms for difference classes of real-time transaction can achieve significant improvement in the system performance.

Performance evaluation of instruction scheduling on the IBM RISC System/6000

article Free Access Share on Performance evaluation of instruction scheduling on the IBM RISC System/6000 Authors: David Bernstein View Profile , Doron Cohen View Profile , Yuval Lavon View Profile , Vladimir Rainish View Profile Authors Info & Claims ACM SIGMICRO NewsletterVolume 23Issue 1-2Dec. 1992 pp 226–235https://doi.org/10.1145/144965.145816Published:10 December 1992Publication History 8citation344DownloadsMetricsTotal Citations8Total Downloads344Last 12 Months13Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF