检索结果-内蒙古大学图书馆

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Chih-Yao Chuang Yung-Chieh Chen Chih-Wen Hsueh Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan R.O.C.

ISBN: (纸本)9781509024803

End-to-end delay is one of the most important timing constraints in distributed real-time systems (DRTS) [1], especially in the area of wireless sensor network (WSN) or Internet of Things (IoT). Since we may need to collect data from sensor nodes and react immediately. Thus, tasks must be executed in a distance-constrained manner. That is, the temporal distance between any two consecutive executions of a task should always be less than a certain amount of time. In DRTS, transactions are decomposed into a group of tasks, and periodic model might not be efficient enough, since the temporal distance between two consecutive executions of task could be two times of its period in the worst case. Moreover, an execution will not be always ready in a period, which might incur extra end-to-end delay in DRTS. Pinwheel scheduling algorithms have been designed to schedule tasks with distance constraint. But meeting distance constraints in a node does not guarantee minimized end-to-end delay of a transaction. Therefore, DSr, a distributed pinwheel scheduling algorithm, focuses on reducing end-to-end delay systematically and synchronously [2]. Although the pinwheel scheduling algorithms provide simple scheduling bounds and approaches for fully utilized tasks, for the simpler sensor nodes with limited hardware timer support, it might not be easy to execute the pinwheel scheduling algorithms accordingly and guarantee the synchronous results. We find that there exists a simple feasible algorithm (e.g. First In First Out, FIFO) with tight scheduling bound. Although it is always schedulable only in low-utilized systems using FIFO, it results in shorter endto- end delays than DSr in most cases with high utilization. To simplify, we focus only on the system of two nodes with the same utilization. As shown in Figure 1, we simulate the total end-to-end delay with different number of transactions, n, and utilization, ρ, and find that FIFO outperforms DSr. That means transactions can be fini

关键词： Delays Wireless sensor networks Real-time systems scheduling algorithms Internet of things

来源：评论

学校读者我要写书评

暂无评论

A heuristic scheduling algorithm based on PSO in the cloud computing environment

引用

International Journal of Future Generation Communication and Networking 2016年第1期9卷 349-362页

作者： Xue, Shengjun Shi, Wenling Xu, Xiaolong School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

In the face of a large number of task requests submitted by users, the data center in the cloud need not only to finish these massive tasks but also to satisfy the user's service demand. How to dividethe resources of the system reasonably and schedule these tasks efficiently isa problem that need be solved in the cloud computing. The task scheduling of workflow is a kind of scheduling model for the most partresearched in cloud computing. The scheduling goal is alwaysdecided by user's QoS(Quality of Service)and the scheduling goal of existing scheduling algorithm is alwayssingle. Based on the price model a scheduling algorithm is proposed which can realize the multiple targets in this article, and the scheduling algorithm is Service Cost Optimizationbased on Particle Swarm Optimization(PSO-SC).PSO-SC algorithm can adapt to dynamic cloud environment, and it not only shortens the completion time of tasks but also minimizesuser's cost of task when schedule tasks. In this paper, experiment and analyze the task scheduling of workflow under the cloud computing environment, and the experimental results show that the algorithm proposed in this paper has very good scheduling performance and can reachthe goal of task scheduling of tasks. © 2016 SERSC.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A zone based improved disk scheduling algorithm

A zone based improved disk scheduling algorithm

引用

(Spring) International Conference on Advances in Computing, Communication, & Automation (ICACCA)

作者： Preeti Pandey Garima Joshi Kamal Kumar Gola Department of CSE Amrapali Institute of Technology and Sciences Haldwani U.K. India Department of CSE TMU Moradabad U.P. India

The main objective of the paper is to propose new disk scheduling to enhance disk performance. Disk performance management is an escalating important facet of operating system research and development. As new types of storage devices are developed, it is necessary to revisit the issue of scheduling to reduce access latency to data on the devices. This work shows the study of various existing disk scheduling algorithms. In these disk scheduling algorithm, we have analyzed that a disk scheduling algorithm with minimum disk access time is best which is totally depend upon it's seek time. So keeping in mind that the seek time has to be minimum, there should be minimum number of disk head movements because seek time is the time entailed by the disk head to move from its current cylinder to the cylinder of the disk request to be fulfilled. Therefore this work proposed a new disk scheduling algorithm that imposes almost no performance penalty over non-real-time optimal schedulers. This paper proposes a new algorithm to improve the seek time. Comparison results has also been compared with the existing algorithms.

关键词： scheduling algorithms Optimal scheduling Magnetic heads Performance evaluation Schedules Operating systems

来源：评论

学校读者我要写书评

暂无评论

Poster Abstract: Preliminary Performance Evaluation of HEF scheduling Algorithm

Poster Abstract: Preliminary Performance Evaluation of HEF S...

引用

IEEE Symposium on Real-Time and Embedded Technology and Applications

作者： Carlos A. Rincon Albert M. K. Cheng Real-time Systems Laboratory University of Houston Houston USA Networking and Telematics Academic Unit Universidad del Zulia Maracaibo Venezuela

Summary form only given. The purpose of this paper is to analyze the performance of the Highest Entropy First (HEF) scheduling algorithm for real-time tasks. The contributions of this paper are: · Generate multiple task sets by implementing the programs from the Seoul National University (SNU) real-time benchmark in Wind River Workbench 3.3 to calculate the WCET and generating the periods by using a linear programming solution aiming to maximize the utilization of the system based on a predefined hyper-period. We implemented the SNU programs (sqrt.c, fibcall.c, crc.c, minver.c and select.c) on a server with an Intel i7-3770 processor running at 3.4 GHz, with 16 GB of RAM and 2 TB hard drive using Wind River Workbench 3.3 to calculate the worst case execution time (WCET). We run each program 100 times to average the results. We created 4 task sets with 2, 3, 4, and 5 tasks respectively. For each task set we used 100 ms as the hyper-period to calculate the periods of the tasks. We implemented a system with implicit deadlines. · Measure the performance of HEF algorithm to schedule real-time tasks using as metrics the number of context switches and deadline-miss ratio. The results from the preliminary performance evaluation show that the number of context switches is directly proportional to the number of tasks in the task set. For the deadline-miss ratio, HEF was able to schedule all the task sets without missing any deadline. Further analysis must be made to confirm that the deadline-miss ratio depends on the utilization of the system (U ≤ 1 = no deadline misses). The HEF algorithm has some similarities with the earliest deadline first algorithm (EDF), therefore we propose as future work to compare the performance of HEF against EDF using the task sets generated by the methodology proposed in this paper.

关键词： Real-time systems Performance evaluation scheduling algorithms Electronic mail Rivers Schedules Context

来源：评论

学校读者我要写书评

暂无评论

Improved priority based scheduling algorithm for real time embedded systems

Improved priority based scheduling algorithm for real time e...

引用

International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： C Keerthanaa M Poongothai Dept. of ECE Coimbatore Institute of Technology Coimbatore India

ISBN: (纸本)9781509012787

Most of the real time systems are framed with aid of priority based scheduling algorithms. If the task is not scheduled accurately the percentage of deadline missing the tasks will exaggerate. In RTOS, when a high priority task is allowed to preempt the low priority task which results in context switching. Due to context switching, processor time and energy will get famished. To overcome these problems the controlled preemptive EDF (CP-EDF) scheduling algorithm is proposed so that preemptions have been controlled. The objective of the proposed CP-EDF scheduling algorithm is to avoid processor time and energy from getting wasted. The results are compared with fully preemptive EDF (FP-EDF) scheduling algorithm and non preemptive (NP-EDF) scheduling algorithm and concluded that the proposed CP-EDF scheduling algorithm outperforms the existing NP-EDF and FP-EDF scheduling algorithms in terms of success ratio, missing rate and CPU utilization.

关键词： scheduling algorithms Real-time systems Dynamic scheduling Switches Delays Context

来源：评论

学校读者我要写书评

暂无评论

On the secrecy capacity of multi-cell uplink networks with opportunistic scheduling

On the secrecy capacity of multi-cell uplink networks with o...

引用

IEEE International Conference on Communications (ICC)

作者： Hu Jin Bang Chul Jung Won-Yong Shin Dept. Electronics and Communication Engineering Hanyang University Ansan Korea Dept. Electronics Engineerring Chungnam National University Daejeon Korea Division of Mobile Systems Engineering Dankook University Yongin Korea

In this paper, we propose a novel user scheduling that achieves the optimal multi-user diversity gain in multi-cell uplink networks with multiple eavesdroppers. In the proposed scheduling, each base station (BS) selects a certain user based on two pre-determined thresholds (i.e., scheduling criteria). The first threshold is related to the amount of generating interference of the users to other BSs and the second threshold is related to the maximum amount of information overheard by the eavesdroppers in the network. Simulation results show that the proposed scheduling significantly outperforms the other scheduling algorithms in terms of secrecy throughput. Note that the proposed scheduling can operate with a distributed manner when time division duplex is adopted, i.e., no coordination among different BSs is needed.

关键词： Throughput Interference Uplink Diversity methods scheduling Fading channels scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluations of network coding-based scheduling approach for wireless data disseminations with time constraints

Evaluations of network coding-based scheduling approach for ...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Chunting Yan Shujuan Wang School of Information Engineering and Automation Kunming University of Science and Technology Kunming China

ISBN: (纸本)9781509040940

On-demand data broadcast has been broadly utilized In wireless communication networks. With the rapid increase of on-demand data dissemination services in burgeoning applications, clients are not satisfied with one data item per request but turn to multiple data item per request, while most of the existing scheduling algorithms focus on single-item request environment. In this work, we lucubrate the performance of the original scheduling algorithms that are proposed for single-item request based on network coding in multi-item request circumstances. The simulations come out that more hot data requested and larger cache size have positive effects on the performance of average access time and deadline miss ratio.

关键词： Servers scheduling algorithms Wireless communication Encoding Data models Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A load feedback based resource scheduling algorithm for IaaS cloud platform

A load feedback based resource scheduling algorithm for IaaS...

引用

IEEE International Conference on Consumer Electronics-Taiwan (ICCE-TW)

作者： Bingxu Wang Dan Tao Zhaowen Lin School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Network and Information Center Beijing University of Posts and Telecommunications Beijing China National Engineering Laboratory for Mobile Network Security

ISBN: (纸本)9781509020744

In this paper, we integrate Hadoop onto IaaS cloud platform and propose a new Dynamic Hadoop Cluster on IaaS (DHCI) architecture. In DHCI architecture, three key modules are designed, they are monitoring module, virtual machine management module and scheduling module. The load information of both physical hosts and virtual machines are collected by the monitoring module, and can be used for designing a load feedback based resource scheduling algorithm. The basic idea of the solution is to dynamically balance the load of physical hosts and virtual machines by differentiated service. Simulation results show that our solution can balance workload and improve system performance.

关键词： Computer architecture Virtual machining Cloud computing Monitoring scheduling algorithms Dynamic scheduling Simulation

来源：评论

学校读者我要写书评

暂无评论

An improved SJF scheduling algorithm in cloud computing environment

An improved SJF scheduling algorithm in cloud computing envi...

引用

International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT)

作者： Mokhtar A. Alworafi Atyaf Dhari Asma A. Al-Hashmi A. Basit Darem Suresha DoS in CS Mysore University India DoCS Thi_Qar University Iraq

ISBN: (纸本)9781509046980

Today, the service provider has to serve many users and the increase of the requests or tasks from the users to the cloud providers has become one of the scalable techniques to proposed the services. Many scheduling algorithms have been proposed to schedule the tasks in cloud computing environment such as (SJF) and (FCFS) algorithms. This paper aims to improve the shortest job first scheduling algorithm in the cloud computing. In tasks scheduling (TS), the most important parameters are makespan and response time. Therefore, we have proposed a Modified Shortest Job First algorithm (MSJF) to minimize the completion time of the last task (Makespan) and minimize the average response time with maximizing the resources utilization. MSJF has two functions, one is calculating the average of tasks length and the other one is Load-Balancing between the virtual machines. One of the important advantages of MSJF is sending the longest tasks to the fastest Machine. We compared the result of our proposed algorithm MSJF with SJF and FCFS. The performance of MSJF is better compared to SJF and FCFS.

关键词： Cloud computing scheduling algorithms Time factors Virtual machining Load management Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Real-Time Workflow scheduling in the Cloud

Uncertainty-Aware Real-Time Workflow Scheduling in the Cloud

引用

IEEE International Conference on Cloud Computing, CLOUD

作者： Huangke Chen Xiaomin Zhu Dishan Qiu Ling Liu Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China College of Computing Georgia Institute of Technology Atlanta GA USA

scheduling real-time workflows running in the Cloud often need to deal with uncertain task execution time and minimize uncertainty propagation during the workflow runtime. Efficient scheduling approaches can minimize the operational cost of Cloud providers and provide higher guarantee of the quality of services (QoS) for Cloud consumers. However, most of the existing workflow scheduling approaches are designed for the individual workflow runtime environments that are deterministic. Such static workflow schedulers are inadequate for multiple and dynamic workflows, each with possibly uncertain task execution time. In this paper, we address the problem of minimizing uncertainty propagation in real-time workflow scheduling. We first introduce an uncertainty-aware scheduling architecture to mitigate the impact of uncertainty factors on the quality of workflow schedules. Then we present a dynamic workflow scheduling algorithm (PRS) that can dynamically exploit proactive and reactive scheduling methods. Finally, we conduct extensive experiments using real-world workflow traces and our experimental results show that PRS outperforms two representative scheduling algorithms in terms of costs (up to 60%), resource utilization (up to 40%) and deviation (up to 70%).

关键词： Cloud computing scheduling Uncertainty Computer architecture Schedules scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：