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

Journal of Software Engineering 2015年第1期9卷 33-49页

作者： Yanpei, Liu Chunlin, Li Zhiyong, Yang Yuxuan, Chen Lijun, Xu Department of Computer Science Wuhan University of Technology China Information Engineering College Henan Institute of Science and Technology China Department of Microelectronics and Solid-State Electronics University of Electronics Science and Technology China

In this study, a job scheduling model and task scheduling algorithm-Cost-Optimal Algorithm of Multi-QoS Constraints for Task scheduling in Hybrid-Cloud (CAMTH) are proposed to solve the task scheduling problem for hybrid cloud. In the job scheduling model, a hybrid cloud agent which acts as a mediator between clients and public cloud resources is presented to facilitate choosing the candidate service that has the most appropriate price and higher quality level. The proposed CAMTH is divided into three steps, namely task scheduling of private cloud, service selection and task scheduling of public clouds. In addition, CAMTH supports security and reliability under conditions of QoS constraints, in order to select the optimal price public cloud resources on the basis of the eligible conditions. In order to prove the functionality of the proposed algorithm, several experiments are carried out. Experimental result shows that CAMTH algorithm achieves a better balance with waiting time, executing time, QoS satisfaction and execution cost. © 2015 Academic Journals Inc.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

scheduling of rate-constrained and time-triggered traffic in multi-cluster TTEthernet systems

Scheduling of rate-constrained and time-triggered traffic in...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Mohammed Abuteir Roman Obermaisser University of Siegen Germany

Multi-cluster systems with real-time networks are gaining increasing importance to address the communication needs of large-scale embedded systems in different domains such as automotive, factory automation and health-care systems. At the same time, heterogeneous application subsystems with varying criticality levels require different timing models including time-triggered communication, event-triggered communication with rate-constraints and best-effort communication. An example is the coexistence of periodic control functions, event-triggered comfort functions and streaming multimedia services of in-vehicle electronic systems. This paper presents a scheduling algorithm as well as a simulation and verification framework for such multi-cluster systems. We support the allocation and scheduling of time-triggered and rate-constrained services to processing elements and communication links of multiple Time-Triggered Ethernet (TTE) clusters. The simulation and verification framework supports the automatic generation of test cases based on generic scenario parameters including the connectivity degree as well as the number of clusters, processing elements, switches and services. Thereby, we enable a comprehensive evaluation of the scheduling algorithm for use cases of varying complexity. In addition, the simulation and verification framework is a foundation for the systematic comparison of different scheduling algorithms including the evaluation of schedulability and runtime for different types of scenarios.

关键词： scheduling algorithms Generators Optimal scheduling scheduling Computational modeling Schedules Mathematical model

来源：评论

学校读者我要写书评

暂无评论

2015 IEEE 82nd Vehicular Technology Conference, VTC Fall 2015 - Proceedings

2015 IEEE 82nd Vehicular Technology Conference, VTC Fall 201...

引用

82nd IEEE Vehicular Technology Conference, VTC Fall 2015

The proceedings contain 412 papers. The topics discussed include: 3D beamforming for spectral coexistence of satellite and terrestrial networks;a balloon-based wireless relay system for disaster response;a case study on using probabilistic verification to find failures in a cooperative driving application;a cluster-based cooperative localization algorithm;a cooperative model for enhancing spectral efficiency in two-way amplify-and-forward relaying networks;a distributed mode selection scheme in cellular-device to device networks;a distributed scheduling algorithm for heterogeneous cache-enabled small cell networks using ADMM;a framework for evaluating multi-kilowatt highly-resonant wireless power transfer systems;a game theoretic approach for the ride-sourcing territory sharing problem;a MDP-based dynamic scheduling scheme for deadline constrained content distribution in wireless heterogeneous network;a multi-replica decoding technique for contention resolution diversity slotted aloha;and a novel fuzzy pedestrian dead reckoning system for indoor positioning using smartphone.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

User pilot scheduling in massive MIMO systems

User pilot scheduling in massive MIMO systems

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Sisi Yue Ju Liu Chao Zhai Qing Wang National Mobile Communications Research Laboratory Southeast University Nanjing China School of Information Science and Engineering Shandong University Jinan China Shandong University Jinan Shandong CN

ISBN: (纸本)9781467376884

One bottleneck of the massive multi-input multi-output (MIMO) systems is the pilot contamination caused by users sharing the non-orthogonal pilots. The pilot contamination contributes significantly to the channel estimation error at the base station (BS) and finally results in the saturation of user rates. This paper firstly analyzes the mean square error (MSE) of the channel estimation at the BS. Inspired by the results, this paper then proposes a user pilot scheduling algorithm which preferentially minimizes the channel estimation MSE of users with poorer channel qualities. Simulation results show that the algorithm significantly improves the achievable rates of the poorer users as well as the system sum rate compared with the conventional way.

关键词： Channel estimation Contamination MIMO Fading Antennas scheduling algorithms Training

来源：评论

学校读者我要写书评

暂无评论

scheduling bags of tasks and gangs in a distributed system

Scheduling bags of tasks and gangs in a distributed system

引用

International Conference on Computer, Information and Telecommunication Systems (CITS)

作者： Zafeirios C. Papazachos Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki Thessaloniki Greece

scheduling algorithms play an important role in the performance of distributed systems. A scheduling algorithm is more efficient when it is designed to handle complex workloads which may consist of different types of parallel jobs. In this paper we examine the performance of hybrid scheduling algorithms which can handle diverse workloads consisting of a mixture of bags of independent gangs and bags of tasks. Gangs are jobs which consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. A simulation model is used to reveal the significant role of the proposed hybrid scheduling algorithms which can handle simultaneously different types of parallel jobs which coexist in the workload.

关键词： scheduling algorithms Program processors Time factors scheduling Computational modeling Schedules

来源：评论

学校读者我要写书评

暂无评论

Distributed scheduling Algorithm for Highly Available Component Based Applications

Distributed Scheduling Algorithm for Highly Available Compon...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Marc Eduard Frincu Department of Electrical Engineering University of Southern California Los Angeles CA

ISBN: (纸本)9781467376853

The emergence of multi-clouds makes it difficult for application providers to offer reliable applications to end users. The different levels of infrastructure reliability offered by various cloud providers need to be abstracted at application level through application-aware algorithms for high availability. This task is challenging due to the closed world approach taken by the various cloud providers. In the face of different access and management policies orchestrated distributed management algorithms are needed instead of centralized solutions. In this paper we present a decentralized autonomic algorithm for achieving application high availability by harnessing the properties of scalable component-based applications and the advantage of overlay networks to communicate between peers. In a multi-cloud environment the algorithm maintains cloud provider independence while achieving global application availability. The algorithm was tested on a simulator and results show that it gives similar results to a centralized approach without inducing much communication overhead.

关键词： Relays Reliability scheduling algorithms Peer-to-peer computing Connectors Overlay networks scheduling

来源：评论

学校读者我要写书评

暂无评论

An efficient data packet scheduling schemes in wireless sensor networks

An efficient data packet scheduling schemes in wireless sens...

引用

International Conference on Electronics and Communication Systems (ICECS)

作者： R. Gomathi N. Mahendran M. Kumarasamy College of Engineering M.E-Communication Systems Karur India

Wireless sensor networks (WSN) are designed for data gathering, processing and transmitting with particular requirements: low hardware complexity, low energy consumption, special traffic pattern support, scalability, and in some cases, real-time operation. The emergence of wireless cyber physical systems leads to the need of real time scheduling of data packets. Developing packet scheduling algorithms in WSNs can efficiently enhance delivery of packets through wireless links. Packet scheduling is a process defined as selecting or rejecting a packet depending upon a decision. The packets are transmitted based on various algorithms within the network and there is a possibility of dropping the packets due to packet size, bandwidth, packet arrival rate, deadline of packet. To achieve real time delivery, the paths must deliver the data in time. Some of the algorithms have been selected for packet scheduling of real time data to achieve predictable and bounded end-to-end latencies while meeting the deadlines of queries, in which NJNC (Nearest Job Next-with combination) outperforms in mobility assisted data collection with combination of multiple requests served together in on-demand manner without starvation problem as in the case of existing schemes like first-come-first-serve (FCFS), shortest-job-next (SJN). The results shows that NJNC provides better performance than the nearest-job-next(NJN).

关键词： Wireless sensor networks Sensors Data collection Real-time systems scheduling algorithms Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Distributed scheduling for coexistence of IoT wireless devices

Distributed scheduling for coexistence of IoT wireless devic...

引用

International Conference on Information and Communication Technology Convergence (ICTC)

作者： Illsoo Sohn Sang Hyun Lee Department of Electronic Engineering Gachon University Gyeonggi Korea Department of Information and Communications Engineering Sejong University Seoul Korea

In this paper, we propose a distributed scheduling scheme for internet-of-things (IoT) wireless devices. The scheduling determination that maximizes overall sum rate of the network is formulated as an optimization problem, which is very challenging because there exists no centralized coordinator in the typical IoT network. To resolve this, we introduce the-state-of-the-art message-passing framework and develop a distributed scheduling algorithm based on it. Our simulation results verify that the proposed distributed scheduling algorithm considerably outperforms previous distributed approaches.

关键词： Wireless communication scheduling Wireless sensor networks Multiaccess communication scheduling algorithms Receivers Zinc

来源：评论

学校读者我要写书评

暂无评论

The Dynamic Delay scheduling Algorithm Based on Task Classification

The Dynamic Delay Scheduling Algorithm Based on Task Classif...

引用

International Conference on Computational Intelligence Theory, Systems and Applications (CCITSA)

作者： Bing Zhao Yun Liu Bo Shen Beijing Municipal Commission of Education Beijing Jiaotong University Beijing China National Engineering Laboratory for Mobile Internet Systems and Applications Beijing Jiaotong University Beijing China

MapReduce is currently the most mainstream parallel computation model to deal with large-scale datasets, and as for a crucial module of MapReduce, the task scheduling has important research meanings. However, there are two mainly problems with existing delay scheduling algorithm: (1) the theoretical assumption of that all tasks are short tasks is limitary, and when nodes process tasks of different lengths, performance of this algorithm will decline, (2) all tasks are based on permanent waiting time and that cannot meet the needs of different users. In order to solve these two problems, this paper comes up with The Dynamic Delay scheduling Algorithm Based on Task Classification (TCDDS). The TCDDS algorithm divides all tasks into different categories by using fuzzy mathematics and gives different waiting time to different categories tasks, thus the response time of the whole job will be reduced and the performance of this algorithm will be improved.

关键词： scheduling algorithms Delays Heuristic algorithms Classification algorithms Computational modeling Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

A weakly hard real-time tasks on global scheduling of multiprocessor systems

A weakly hard real-time tasks on global scheduling of multip...

引用

Malaysian Conference in Software Engineering (MySEC)

作者： Habibah Ismail Dayang N. A. Jawawi Mohd Adham Isa Software Engineering Department Universiti Teknologi Malaysia Johor Malaysia

Real-time tasks can be classified into three categories, based on the “seriousness” of deadline misses - hard, soft and weakly hard real-time tasks. The consequences of a deadline miss of a hard real-time task cannot be accepted whereas soft real-time tasks tolerate “some” deadline misses. While, in a weakly hard real-time task, the distribution of its met and missed deadlines is stated and specified precisely. Due to the complexity and significantly increased functionality in system computation, attention has been given to multiprocessor scheduling, comprised of several processors. Due to the fact that in multiprocessor, there have more than one processor, algorithms which can cater higher computational complexity for task allocation and for task migration are highly required. Thus, the sufficient and efficient scheduling algorithm supported by accurate schedulability analysis technique is presented to provide weakly hard real-time guarantees. In this paper, a schedulability analysis to schedule weakly hard real-time tasks has been proposed by using the global multiprocessor scheduling technique, called multiprocessor response time analysis combining with the exact analysis, named hyperperiod analysis and deadline models; weakly hard constraints and μ-pattern under static priority scheduling. Then, the Matlab simulation tool is used in order to validate the result of analysis. From the performance evaluation results, it proved that the proposed approach is satisfied the tasks deadlines with less number of misses.

关键词： Real-time systems Program processors Optimal scheduling scheduling algorithms Time factors Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：