scispace - formally typeset
Search or ask a question
Author

Yi-wen Zhang

Other affiliations: Chinese Academy of Sciences
Bio: Yi-wen Zhang is an academic researcher from Huaqiao University. The author has contributed to research in topics: Energy consumption & Scheduling (computing). The author has an hindex of 7, co-authored 23 publications receiving 125 citations. Previous affiliations of Yi-wen Zhang include Chinese Academy of Sciences.

Papers
More filters
Journal ArticleDOI
TL;DR: This work proposes a novel energy-aware mixed partitioning scheduling algorithm (EAMPSA) for dynamic-priority real-time task set with shared resources in a standby-sparing system and uses the mixed mapping partitioning of primary and backup tasks method to map tasks.

24 citations

Journal ArticleDOI
TL;DR: A dynamic task synchronization for sporadic task (DTSST) algorithm which can reclaim the slack time generated from the early completion task is proposed which combines the DVS technique and the DPM technique to reduce energy consumption.

23 citations

Journal ArticleDOI
TL;DR: A more energy efficient approach called a dynamic low power sporadic tasks scheduling algorithm (DSTLPSA) is proposed, based on reclaiming the dynamic slack and adjusting the speed of other tasks on-the-fly in order to reduce energy consumption while still meeting the deadlines.

18 citations

Journal ArticleDOI
TL;DR: It is proved that the problem of the reliability-aware low power scheduling for periodic tasks with shared resources is NP-hard and two heuristic algorithms are presented called SPF and LPF respectively.

18 citations

Journal ArticleDOI
Yi-wen Zhang1
TL;DR: A dynamically frequency updating mixed-criticality algorithm (DFU) based on the earliest deadline first scheme that can exploit the slack time generated from high criticality tasks in a low criticality mode to reduce processor frequency and dynamically update the utilization of sporadic tasks set to further reduce processors frequency is proposed.
Abstract: The mixed-criticality system provides multiple real-time applications with different criticalities in a single system. Poor energy-saving performance of the previous studies on mixed-criticality sporadic tasks are mainly due to the fact that the slack time generated from the random arrival of sporadic tasks is not taken into account. In this article, we focus on scheduling energy aware mixed-criticality sporadic tasks and take the random arrival of sporadic tasks into account. We proposed a dynamically frequency updating mixed-criticality algorithm (DFU). DFU based on the earliest deadline first scheme can exploit the slack time generated from high criticality tasks in a low criticality mode to reduce processor frequency. In addition, it also can dynamically update the utilization of sporadic tasks set to further reduce processor frequency. The simulation experiments are conducted to evaluate the performance of DFU and experimental results show that DFU consumes 34.29% less energy than that of the existing algorithms.

17 citations


Cited by
More filters
01 Jun 2006
TL;DR: The combined deterministic-stochastic subspace identification algorithm for the experimental modal analysis of mechanical structures is discussed and the main advantages of OMAX over OMA are that the modes that are excited by the artificial forces can be scaled to unity modal mass and that a higher number of modes can be identified.
Abstract: In this paper, the use of the combined deterministic-stochastic subspace identification algorithm for the experimental modal analysis of mechanical structures is discussed. The algorithm requires artificial forces to be applied to the structure, so it can be used for experimental modal analysis (EMA). The algorithm can also be used for operational modal analysis (OMA), since the excitation level of the artificial force(s) can be low compared to the excitation level of the ambient forces. Both the modes that are artificially excited and those that are excited by the ambient forces are identified. This type of operational modal analysis is called an OMAX analysis (Operational Modal Analysis with eXogenous inputs) [1]. The main advantages of OMAX over OMA are that the modes that are excited by the artificial forces can be scaled to unity modal mass and that a higher number of modes can be identified.

309 citations

Journal ArticleDOI
TL;DR: The proposed multi-objective model finds optimal trade-off solutions amongst the four conflicting objectives, which significantly reduces the job response time and makespan and not only increases QoS but also decreases the cost to providers.
Abstract: Optimizing task scheduling in a distributed heterogeneous computing environment, which is a nonlinear multi-objective NP-hard problem, plays a critical role in decreasing service response time and cost, and boosting Quality of Service (QoS). This paper, considers four conflicting objectives, namely minimizing task transfer time, task execution cost, power consumption, and task queue length, to develop a comprehensive multi-objective optimization model for task scheduling. This model reduces costs from both the customer and provider perspectives by considering execution and power cost. We evaluate our model by applying two multi-objective evolutionary algorithms, namely Multi-Objective Particle Swarm Optimization (MOPSO) and Multi-Objective Genetic Algorithm (MOGA). To implement the proposed model, we extend the Cloudsim toolkit by using MOPSO and MOGA as its task scheduling algorithms which determine the optimal task arrangement among VMs. The simulation results show that the proposed multi-objective model finds optimal trade-off solutions amongst the four conflicting objectives, which significantly reduces the job response time and makespan. This model not only increases QoS but also decreases the cost to providers. From our experimentation results, we find that MOPSO is a faster and more accurate evolutionary algorithm than MOGA for solving such problems.

89 citations

Journal Article
TL;DR: This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system, introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule.
Abstract: This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system. It introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule. Illustrative examples include a single resource scheduler, a bounded buffer, an alarm clock, a buffer pool, a disk head optimizer, and a version of the problem of readers and writers.

79 citations

Journal ArticleDOI
TL;DR: An enhanced multi- objective co-evolutionary algorithm, called OL-PICEA-g, is proposed for solving the multi-objective energy-efficient task scheduling problem on a green data center partially powered by the renewable energy, where the computing nodes of the data center are DVFS-enabled.

62 citations

Journal ArticleDOI
TL;DR: Two methods are proposed to transform the reliability goal of the application into each task for non-DVFS and DVFS, respectively, to minimize energy consumption with reliability goal for parallel application on heterogeneous embedded systems.

30 citations