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

IEEE International Conference on Cloud Engineering (IC2E)

作者： Amin Rezaeian Hamid Abrishami Saeid Abrishami Mahmoud Naghibzadeh Dept of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

In hybrid cloud model, organizations can keep their sensitive information and critical applications in the private cloud and move other data and applications to a public cloud, if necessary. To maintain data privacy in workflow applications, we present a budget constrained hybrid cloud scheduler (BCHCS) which is a static heuristic scheduling algorithm. It is able to make decisions about scheduling sensitive tasks on private cloud and uses public cloud's resources for non-sensitive tasks, such that the makespan is minimized, while the budget limitation imposed by the user is satisfied. Experimental results show that the proposed method guarantees the execution of sensitive tasks on private cloud while achieving at least 7 percent lower makespan and higher success rate in comparison to similar existing techniques.

关键词： Cloud computing Schedules scheduling algorithms scheduling Data privacy Workflow management software Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive packet scheduling for scalable video streaming with network coding

Adaptive packet scheduling for scalable video streaming with...

引用

IEEE International Conference on Communications (ICC)

作者： Shenglan Huang Ebroul Izquierdo Pengwei Hao School of Electrical Engineering and Computer Science Queen Mary University of London London UK

In advanced Peer-to-Peer delivery systems, each user downloads a video stream and at the same time uploads the same stream to other users. In live streaming, scalable video streaming is also proposed to allow partial decoding of the video streaming at a reduced resolution, frame-rate or quality, adapting to different display requirements and receptions conditions of heterogeneous receivers. In live streaming applications, Network Coding (NC) has the potential to bring substantially higher throughput while reducing transmission delays. However, the bandwidth efficiency of NC transmission is still a problem to live media streaming due to the lack of synchronization among peers. To solve this problem, we introduce a scalable streaming system, which includes a layer selection algorithm and a distributed packet scheduling algorithm. The proposed system is tested by streaming a scalable video over a peer-to-peer network. The experimental results confirm that the proposed algorithm achieves better video quality, better delivery ratio, and lower transmission redundancy.

关键词： Peer-to-peer computing Streaming media Bandwidth Receivers Network coding Media scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Task scheduling Algorithm in Cloud Computing Environment Based on Cloud Pricing Models

Task Scheduling Algorithm in Cloud Computing Environment Bas...

引用

World Symposium on Computer Applications & Research

作者： Elhossiny Ibrahim Nirmeen A. El-Bahnasawy Fatma A. Omara Computer Science & Eng. Dept. Faculty of Electronic Eng. Menouf Egypt Faculty of Computers & information Cairo University Egypt

ISBN: (纸本)9781509041152

The Cloud Computing is a most widely spreading platform for executing tasks using virtual machines (VMs) as processing elements. Therefore, implementing HPC using Cloud Computing is considered a powerful approach by isolating tasks, reducing execution time, as well as, price, and satisfying load balance. In this paper, an enhancement task scheduling algorithm on the Cloud Computing environment has been introduced to reduce the make-span, as well as, decrease the price of executing the independent tasks on the cloud resources. The principles of the algorithm is based on calculating the total processing power of the available resources (i.e., VMs) and the total requested processing power by the users' tasks, then allocating a group of users' tasks to each VM based on the ratio of its needed power relative to the total processing power of all VMs. The power of VMs has been defined based on Amazon EC2 and Google pricing models. To evaluate the performance of the enhancement algorithm, a comparative study has been done among this enhancement algorithm, the default FCFS algorithm, and the existed GA, and PSO algorithms. The experimental results show that the enhancement algorithm outperforms other algorithms by reducing make-span and the price of the running tasks.

关键词： Cloud computing Genetic algorithms Pricing Google Mathematical model scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Bottleneck Identification Based Differential Evolution Algorithm for scheduling Complex Manufacturing Lines

A Novel Bottleneck Identification Based Differential Evoluti...

引用

International Conference on Information Science and Control Engineering (ICISCE)

作者： Yong Sun Peng Jiang Beijing Research Institute of Mechanical and Electrical Technology (BRIMET) Beijing China

ISBN: (纸本)9781509025367

This paper presents a bottleneck identification based differential evolution algorithm for scheduling complex production lines. Operation priority sequences of bottleneck machine groups are determined by the differential evolution algorithm, while operation priority sequences of non-bottleneck machine groups are determined by predefined heuristic rules. The bottleneck identification method is presented based on the average flow time of all operations on each machine groups. The machine groups with longer average flow time are considered to be bottlenecks of manufacturing lines. In the differential evolution algorithm, mutation process is constructed by the operation priority differences and crossover process is constructed by operation priority swap. DE/best/1/bin and DE/rand/1/bin are used together to improve the efficiency while avoiding prematurity. Simulation results indicate the validity and efficiency of the algorithm presented in this paper.

关键词： Manufacturing Job shop scheduling Sociology Statistics Algorithm design and analysis scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Transfer time-aware workflow scheduling for multi-cloud environment

Transfer time-aware workflow scheduling for multi-cloud envi...

引用

International Conference on Computing, Communication & Automation (ICCCA)

作者： Indrajeet Gupta Madhu Sudan Kumar Prasanta K. Jana Department of Computer Science and Engineering Indian School of Mines Dhanbad India

ISBN: (纸本)9781509016679

In the recent years, multi-cloud environment has attracted significant attention of the research community. Workflow scheduling in a multi-cloud environment is a challenging problem which is known to be NP-complete in nature. In this paper we propose an efficient workflow scheduling algorithm for multi-cloud environment which is based on transfer time consciousness. The proposed algorithm has two phases similar to Heterogeneous Earliest Finish time (HEFT) algorithm which was developed for multiprocessor system. The first phase calculates the B-Level priority of the tasks and second phase undergoes the virtual machines (VMs) selection based on the calculated B-level priority of the tasks. We simulate the proposed algorithm for standard scientific workflows and compare the simulated results with two existing workflow scheduling algorithms as per the proposed model. The results noticeably indicate that the proposed algorithm outperforms both the algorithms in terms of makespan and average cloud utilization.

关键词： Cloud computing Virtual machining scheduling Computational modeling scheduling algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

ChEsS: Cost-Effective scheduling Across Multiple Heterogeneous Mapreduce Clusters

ChEsS: Cost-Effective Scheduling Across Multiple Heterogeneo...

引用

International Conference on Autonomic Computing (ICAC)

作者： Nikos Zacheilas Vana Kalogeraki Athens University of Economics and Business Athens Greece

ISBN: (纸本)9781509016556

In recent years many organizations adopt the usage of multiple concurrent MapReduce frameworks running on different clusters in order to support data, failure, version and performance isolation for their Big Data applications. However, efficiently scheduling MapReduce workloads in such environments can be particularly challenging due to the observed tradeoff between the need for performance and the corresponding monetary cost. The problem is exacerbated by the fact that jobs have locality constraints and clusters employ different intrajob scheduling policies (e.g., FIFO, FAIR) for the execution of their jobs, affecting significantly the workload's execution time. In this paper we describe our approach for scheduling MapReduce jobs in multicluster environments taking into consideration the performance/budget tradeoff. Our approach makes the following contributions: (i) ChEsS, a novel Paretobased scheduling framework for identifying near-optimal jobsto-clusters assignments for user's workloads with respect to performance and cost, and (ii) a model that considers the impact of the different intra-job scheduling algorithms and the jobs' locality constraints on the observed performance and required budget. Our detailed experimental evaluation using both scientific and industry workload traces illustrate the working and benefits of our approach.

关键词： Measurement Job shop scheduling Clustering algorithms Computational modeling scheduling algorithms Organizations

来源：评论

学校读者我要写书评

暂无评论

Packet importance based scheduling strategy for H.264 video transmission in wireless networks

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2015年第23期74卷 10259-10275页

作者： Li, Fan Zhang, Danyang Wang, Liejun Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China Xinjiang Univ Sch Informat Sci & Engn Urumqi 830046 Peoples R China

This paper investigates the problem of H.264 video transmission in wireless networks. We propose a packet scheduling algorithm based on the packet quality contribution index (PQCI) of H.264 video packet. The PQCI is estimated not only by the quality distortion made for the current frame, but also by that made for the frames which are directly or indirectly related with current frame. A dual-decoder-model (DDM) algorithm is proposed for the PQCI estimation. In DDM algorithm, we develop a novel architecture with two simulated decoders in the sender. To reduce the computational complexity, an estimated-model (EM) algorithm is also proposed. In EM algorithm, the coding characters of video that are pre-coded are extracted for the PQCI estimation. The results demonstrate that our schemes can bring a significant gain to the end-to-end video quality with respect to traditional methods.

关键词： Multimedia communication Packet distortion Packet loss scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

On the Decomposition-Based Global EDF scheduling of Parallel Real-Time Tasks

On the Decomposition-Based Global EDF Scheduling of Parallel...

引用

Real-Time Systems Symposium (RTSS)

作者： Xu Jiang Xiang Long Nan Guan Han Wan Beihang University China Hong Kong Polytechnic University Hong Kong

Real-time systems are shifting from single-core to multi-core processors, on which software must be parallelized to fully utilize the additional computation power. Recently different types of scheduling algorithms and analysis techniques have been proposed for parallel real-time tasks modeled as directed acyclic graphs (DAG). However, this field is still much less mature than traditional real-time scheduling of sequential tasks. In this paper, we study the decomposition-based scheduling for parallel real-time tasks, where a task graph is transferred to a set of independent sporadic tasks. In particular, we proposed a new decomposition strategy that better explores the feature of each task, represented by its structure characteristic value, to improve schedulability. The structure characteristic values do not only provide a clear guidance in task decomposition, but also can be directly used for schedulability tests, as well as to quantify the suboptimality of our scheduling algorithm in terms of capacity augmentation bounds. We conduct comprehensive experiments to evaluate the real-time performance of our proposed scheduling algorithm, against the state-of-the-art scheduling and analysis methods of different types. Experiment results show that our method consistently outperforms all of the previous methods under different parameter settings.

关键词： Real-time systems scheduling scheduling algorithms Timing Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Multi-attribute aware multipath data scheduling strategy for efficient MPTCP-based data delivery

Multi-attribute aware multipath data scheduling strategy for...

引用

Asia-Pacific Conference on Communications

作者： Fenfen Ke Minghe Huang Zhihua Liu Qinghua Liu Yuanlong Cao School of Software Jiangxi Normal University Nanchang China Jiangxi Normal University Nanchang Jiangxi CN

ISBN: (纸本)9781509006779

The growing popularity of multihoming techniques has motivated the rise of multipath protocols. Multipath TCP (MPTCP), as an extension of TCP, can use multiple paths to deliver data in parallel without influencing any functionality of TCP. Although applying MPTCP to mobile terminals for data transmission can provide many and attractive benefits, including performance improvement and latency reduction, there is still significant ongoing effort addressing many remaining concerns. One major concern is related to handling buffer blocking. Many researchers have attempted to optimize data scheduling way to mitigate this problem. In this paper, we propose a multiple attribute-aware data scheduling strategy for MPTCP (MPTCP-MA 2 ). The proposed MPTCP-MA 2 solution is invoked to undergo three phases: (i) monitor each path's status information constantly, (ii) use an optimized path sorting algorithm to compare and sort all available paths, (iii) adaptively transmit data packets over multiple paths according to the path sorting result. Furthermore, MPTCP-MA 2 focuses on mitigating buffer blocking as well as boosting the robustness of the data transfer. The simulation result shed light on how MPTCP-MA 2 achieves a little higher throughput than existing solutions.

关键词： Estimation Sorting Receivers Delays Protocols scheduling algorithms Internet

来源：评论

学校读者我要写书评

暂无评论

A Heuristic for scheduling of Uniform Parallel Processors

A Heuristic for Scheduling of Uniform Parallel Processors

引用

International Conference on Computational Intelligence and Networks (CINE)

作者： Satyasundara Mahapatra Rati Ranjan Dash Sateesh Kumar Pradhan Dept. of Compo. Sc. Utkal University Bhubaneswar India Dept. of Mech. Engg. CET Bhubaneswar India

ISBN: (纸本)9781509004522

Parallel processing is one of the arising concepts that are used to process batch of 'n' numbers of tasks through 'm' numbers of parallel processors. These processors are either identical or uniform or unrelated in nature. scheduling is the discipline of decision making for executing the tasks through parallel processors. One of the important criteria of good scheduling is the schedule with minimum Waiting Time variance (WTV). Therefore minimizing WTV is an objective of designing schedulers. Minimizing the variance of the tasks waiting time in the scheduler's ready queue is a NP-Hard problem. Achieving the Quality of Service (QoS) in the parallel Processors by minimizing the variance of the tasks waiting time in the scheduler's ready queue is a problem of task scheduling. To enhance the performance of parallel processing, it is required to develop a stable and none overlap scheduler where variance of waiting time of individual tasks should be minimized treated as an important parameter. This paper presents a unique task distribution style among uniform parallel processor and then applies the three heuristic based solutions named as VS, BS and RSS are intended for Q_m |prec|WTV minimization problem. The experimental results are compared with the existing approaches and shows that the proposed approach provides the best performance for the compared approaches and problems tested with large task set. The findings of intended algorithm are shown in the form of graph for consonant problems.

关键词： Program processors Resource management Mathematical model Job shop scheduling scheduling algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：