A New Task Scheduling Scheme Based on Genetic Algorithm for Edge Computing

With the continuous evolution of smart grid and global energy interconnection technology, amount of intelligent terminals have been connected to power grid, which can be used for providing resource services as edge nodes. Traditional cloud computing can be used to provide storage services and task computing services in the power grid, but it faces challenges such as resource bottlenecks, time delays, and limited network bandwidth resources. Edge computing is an effective supplement for cloud computing, because it can provide users with local computing services with lower latency. However, because the resources in a single edge node are limited, resource-intensive tasks need to be divided into many subtasks and then assigned to different edge nodes by resource cooperation. Making task scheduling more efficient is an important issue. In this paper, a two-layer resource management scheme is proposed based on the concept of edge computing. In addition, a new task scheduling algorithm named GA-EC(Genetic Algorithm for Edge Computing) is put forth, based on a genetic algorithm, that can dynamically schedule tasks according to different scheduling goals. The simulation shows that the proposed algorithm has a beneficial effect on energy consumption and load balancing, and reduces time delay.     

An Optimized Resource Scheduling Strategy for Hadoop Speculative Execution Based on Non-cooperative Game Schemes

Hadoop is a well-known parallel computing system for distributed computing and large-scale data processes. “Straggling” tasks, however, have a serious impact on task allocation and scheduling in a Hadoop system. Speculative Execution (SE) is an efficient method of processing “Straggling” Tasks by monitoring real-time running status of tasks and then selectively backing up “Stragglers” in another node to increase the chance to complete the entire mission early. Present speculative execution strategies meet challenges on misjudgement of “Straggling” tasks and improper selection of backup nodes, which leads to inefficient implementation of speculative executive processes. This paper has proposed an Optimized Resource Scheduling strategy for Speculative Execution (ORSE) by introducing non-cooperative game schemes. The ORSE transforms the resource scheduling of backup tasks into a multi-party non-cooperative game problem, where the tasks are regarded as game participants, whilst total task execution time of the entire cluster as the utility function. In that case, the most benefit strategy can be implemented in each computing node when the game reaches a Nash equilibrium point, i.e., the final resource scheduling scheme to be obtained. The strategy has been implemented in Hadoop-2.x. Experimental results depict that the ORSE can maintain the efficiency of speculative executive processes and improve fault-tolerant and computation performance under the circumstances of Normal Load, Busy Load and Busy Load with Skewed Data.     

Blockchain Based Secured Load Balanced Task Scheduling Approach for Fitness Service

In recent times, the evolution of blockchain technology has got huge attention from the research community due to its versatile applications and unique security features. The IoT has shown wide adoption in various applications including smart cities, healthcare, trade, business, etc. Among these applications, fitness applications have been widely considered for smart fitness systems. The users of the fitness system are increasing at a high rate thus the gym providers are constantly extending the fitness facilities. Thus, scheduling such a huge number of requests for fitness exercise is a big challenge. Secondly, the user fitness data is critical thus securing the user fitness data from unauthorized access is also challenging. To overcome these issues, this work proposed a blockchain-based load-balanced task scheduling approach. A thorough analysis has been performed to investigate the applications of IoT in the fitness industry and various scheduling approaches. The proposed scheduling approach aims to schedule the requests of the fitness users in a load-balanced way that maximize the acceptance rate of the users’ requests and improve resource utilization. The performance of the proposed task scheduling approach is compared with the state-of-the-art approaches concerning the average resource utilization and task rejection ratio. The obtained results confirm the efficiency of the proposed scheduling approach. For investigating the performance of the blockchain, various experiments are performed using the Hyperledger Caliper concerning latency, throughput, resource utilization. The Solo approach has shown an improvement of 32% and 26% in throughput as compared to Raft and Solo-Raft approaches respectively. The obtained results assert that the proposed architecture is applicable for resource-constrained IoT applications and is extensible for different IoT applications.     

面向多用户环境的MapReduce集群调度算法研究

针对MapReduce集群现有调度策略在多用户环境下无法根据用户的实际资源需求实现动态资源分配的问题,提出了一种基于历史执行信息(HEI)的MapReduce集群调度算法——HEI Scheduler。该算法通过建立集群作业执行信息的收集和分析机制,得到各用户组资源需求随时间变化的规律,并以作业实际占用slot的时间作为作业占用资源量的衡量标准,进而动态地确定资源池的最小共享资源以及集群剩余资源分配的权值。实验结果表明,执行信息分析机制能够更准确地表征作业对资源的需求,采用集群调度算法HEI Scheduler能够有效地缩短作业的整体执行时间。     

Heuristic and Bent Key Exchange Secured Energy Efficient Data Transaction for Traffic Offloading in Mobile Cloud

In today’s world, smart phones offer various applications namely face detection, augmented-reality, image and video processing, video gaming and speech recognition. With the increasing demand for computing resources, these applications become more complicated. Cloud Computing (CC) environment provides access to unlimited resource pool with several features, including on demand self-service, elasticity, wide network access, resource pooling, low cost, and ease of use. Mobile Cloud Computing (MCC) aimed at overcoming drawbacks of smart phone devices. The task remains in combining CC technology to the mobile devices with improved battery life and therefore resulting in significant performance. For remote execution, recent studies suggested downloading all or part of mobile application from mobile device. On the other hand, in offloading process, mobile device energy consumption, Central Processing Unit (CPU) utilization, execution time, remaining battery life and amount of data transmission in network were related to one or more constraints by frameworks designed. To address the issues, a Heuristic and Bent Key Exchange (H-BKE) method can be considered by both ways to optimize energy consumption as well as to improve security during offloading. First, an energy efficient offloading model is designed using Reactive Heuristic Offloading algorithm where, the secondary users are allocated with the unused primary users’ spectrum. Next, a novel AES algorithm is designed that uses a Bent function and Rijndael variant with the advantage of large block size is hard to interpret and hence is said to ensure security while accessing primary users’ unused spectrum by the secondary user. Simulations are conducted for efficient offloading in mobile cloud and performance valuations are carried on the way to demonstrate that our projected technique is successful in terms of time consumption, energy consumption along with the security aspects covered during offloading in MCC.     

Improvised Seagull Optimization Algorithm for Scheduling Tasks in Heterogeneous Cloud Environment

Well organized datacentres with interconnected servers constitute the cloud computing infrastructure. User requests are submitted through an interface to these servers that provide service to them in an on-demand basis. The scientific applications that get executed at cloud by making use of the heterogeneous resources being allocated to them in a dynamic manner are grouped under NP hard problem category. Task scheduling in cloud poses numerous challenges impacting the cloud performance. If not handled properly, user satisfaction becomes questionable. More recently researchers had come up with meta-heuristic type of solutions for enriching the task scheduling activity in the cloud environment. The prime aim of task scheduling is to utilize the resources available in an optimal manner and reduce the time span of task execution. An improvised seagull optimization algorithm which combines the features of the Cuckoo search (CS) and seagull optimization algorithm (SOA) had been proposed in this work to enhance the performance of the scheduling activity inside the cloud computing environment. The proposed algorithm aims to minimize the cost and time parameters that are spent during task scheduling in the heterogeneous cloud environment. Performance evaluation of the proposed algorithm had been performed using the Cloudsim 3.0 toolkit by comparing it with Multi objective-Ant Colony Optimization (MO-ACO), ACO and Min-Min algorithms. The proposed SOA-CS technique had produced an improvement of 1.06%, 4.2%, and 2.4% for makespan and had reduced the overall cost to the extent of 1.74%, 3.93% and 2.77% when compared with PSO, ACO, IDEA algorithms respectively when 300 vms are considered. The comparative simulation results obtained had shown that the proposed improvised seagull optimization algorithm fares better than other contemporaries.     

Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling

In this paper, Resource Constrained Scheduling (RCS) consists of scheduling activities on scarce resources, each activity may require more than one resource at a time, and each resource is available in the same quantity throughout the planning period. This paper described a methodology for RCS that can be easily adapted to consider different regular measures of performance. The solution approach is local search using a recent development published in the literature; namely, problem-space based neighborhoods. Computational results are encouraging when searching these spaces using simple local search techniques. Further improvements are explored through the use of a genetic algorithm. In both cases, close-to-optimal solutions are found for standard problems from the literature. The adaptability of the methodology is demonstrated using makespan and mean tardiness as performance measures.     

Application and modeling of resource service trust-QoS evaluation in manufacturing grid system

Resource scheduling is the bottleneck in MGrid; the current research on resource scheduling strategy is mainly based on resource performance-QoS (quality of service), but the factor of trust-QoS is ignored, which will result in unreasonable and unpractical scheduling results. In order to enhance the validity and success rate of resource scheduling in a manufacturing grid (MGrid) system, provide high credible resource service abilities and results to the user, the concept of resource service trust-QoS is presented; trust-QoS was introduced into MGrid resource service scheduling and the important roles it plays emphasized. The trust problems existing in the resource service transaction between resource service demanders (RSD) and resource service providers (RSP) are put forward. The trust-QoS relationship model which is capable of capturing a comprehensive range of trust relationships which exist in the MGrid system is put forward. Then a two-layer resource service trust-QoS evaluation model is put forward, including an intra-domain trust-QoS evaluation model and an inter-domain trust-QoS evaluation model. The quantitative evaluating algorithms of trust-QoS degree value are proposed and described in detail, as well as the value of real-time and dynamic updating algorithms of trust-QoS degree. Finally, an application prototype, namely MBRSPP-MGrid, is developed. The experimental results of the case study show that the proposed models and algorithms are effective and useful.     

Optimized Energy Efficient Strategy for Data Reduction Between Edge Devices in Cloud-IoT

Numerous Internet of Things (IoT) systems produce massive volumes of information that must be handled and answered in a quite short period. The growing energy usage related to the migration of data into the cloud is one of the biggest problems. Edge computation helps users unload the workload again from cloud near the source of the information that must be handled to save time, increase security, and reduce the congestion of networks. Therefore, in this paper, Optimized Energy Efficient Strategy (OEES) has been proposed for extracting, distributing, evaluating the data on the edge devices. In the initial stage of OEES, before the transmission state, the data gathered from edge devices are supported by a fast error like reduction that is regarded as the largest energy user of an IoT system. The initial stage is followed by the reconstructing and the processing state. The processed data is transmitted to the nodes through controlled deep learning techniques. The entire stage of data collection, transmission and data reduction between edge devices uses less energy. The experimental results indicate that the volume of data transferred decreases and does not impact the professional data performance and predictive accuracy. Energy consumption of 7.38 KJ and energy conservation of 55.57 kJ was found in the proposed OEES scheme. Predictive accuracy is 97.5 percent, data performance rate was 97.65 percent, and execution time is 14.49 ms.     

A ROLLING HORIZON HEURISTIC FOR REACTIVE SCHEDULING OF BATCH PROCESS OPERATIONS

Batch chemical plants are dynamic processing facilities where static production schedules can rarely be adhered to due to market and operating uncertainties. On-line schedule modification of a prior; timing assignments and resource allocations in response to unantipicated disruptions is done through a decomposition heuristic that uses a rolling horizon implementation policy. An attempt is made to minimize the impact of the disruptions on the original schedule near the point of each deviation while exploiting the combinatorial flexibility of task and resource reassignments in future scheduling time windows. The problem is addressed as a multiobjective optimization problem involving completion time criteria, relative customer importance, and production cost considerations.

A rigorous analysis of problem sensitive parameters, including penalty weights and subhorizon length, is conducted. A model plant case study is performed. Variations on storage availability and task flexibility are investigated in an attempt to characterize dominant effects of the weighting parameters. Results indicate that user preference can serve as a strong guide for obtaining near optimal reactive scheduling solutions. It is shown that the combinatories can be controlled and that costly and inefficient full scale rescheduling of multipurpose production facilities can be avoided.     

Fuzzy uncertainty modelling for project planning: application to helicopter maintenance

Maintenance is an activity of growing interest, especially for critical systems. In particular, aircraft maintenance costs are becoming an important issue in the aeronautical industry. Managing an aircraft maintenance centre is a complex activity. One of the difficulties comes from the numerous uncertainties that affect the activity and disturb the plans in the short and medium term. Based on a helicopter maintenance planning and scheduling problem, we study in this paper the integration of uncertainties into tactical and operational multi-resource, multi-project planning (respectively Rough Cut Capacity Planning and the Resource Constraint Project Scheduling Problem). Our main contributions are in modelling the periodic workload on a tactical level considering uncertainties in macro-task work content, and modelling the continuous workload on the operational level considering uncertainties in task duration. We model uncertainties using a fuzzy/possibilistic approach instead of a stochastic approach since very limited data are available. We refer to the problems as the Fuzzy Rough Cut Capacity Problem (FRCCP) and the Fuzzy Resource Constraint Project Scheduling Problem (RCPSP). We apply our models to helicopter maintenance activity within the frame of the Helimaintenance project, an industrial project approved by the French Aerospace Valley cluster that aims at building a centre for civil helicopter maintenance.     

Load Balancing Based on Multi-Agent Framework to Enhance CloudEnvironment

According to the advances in users’ service requirements, physical hardware accessibility, and speed of resource delivery, Cloud Computing (CC) is an essential technology to be used in many fields. Moreover, the Internet of Things (IoT) is employed for more communication flexibility and richness that are required to obtain fruitful services. A multi-agent system might be a proper solution to control the load balancing of interaction and communication among agents. This paper proposes a multi-agent load balancing framework that consists of two phases to optimize the workload among different servers with large-scale CC power with various utilities and a significant number of IoT devices with low resources. Different agents are integrated based on relevant features of behavioral interaction using classification techniques to balance the workload. A load balancing algorithm is developed to serve users’ requests to improve the solution of workload problems with an efficient distribution. The activity task from IoT devices has been classified by feature selection methods in the preparatory phase to optimize the scalability of CC. Then, the server’s availability is checked and the classified task is assigned to its suitable server in the main phase to enhance the cloud environment performance. Multi-agent load balancing framework is succeeded to cope with the importance of using large-scale requirements of CC and (low resources and large number) of IoT.     

Task Scheduling Optimization in Cloud Computing by Rao Algorithm

Cloud computing is currently dominated within the space of high-performance distributed computing and it provides resource polling and on-demand services through the web. So, task scheduling problem becomes a very important analysis space within the field of a cloud computing environment as a result of user's services demand modification dynamically. The main purpose of task scheduling is to assign tasks to available processors to produce minimum schedule length without violating precedence restrictions. In heterogeneous multiprocessor systems, task assignments and schedules have a significant impact on system operation. Within the heuristic-based task scheduling algorithm, the different processes will lead to a different task execution time (makespan) on a heterogeneous computing system. Thus, a good scheduling algorithm should be able to set precedence efficiently for every subtask depending on the resources required to reduce (makespan). In this paper, we propose a new efficient task scheduling algorithm in cloud computing systems based on RAO algorithm to solve an important task and schedule a heterogeneous multiple processing problem. The basic idea of this process is to exploit the advantages of heuristic-based algorithms to reduce space search and time to get the best solution. We evaluate our algorithm's performance by applying it to three examples with a different number of tasks and processors. The experimental results show that the proposed approach significantly succeeded in finding the optimal solutions than others in terms of the time of task implementation.     

串联生产系统智能维护调度实验平台研究

结合工业工程专业学习需求,设计了考虑有限缓存的串联生产系统维护调度实验平台。实验平台由维护调度计算模块和维护调度演示模块组成。维护调度计算模块基于Matlab,在考虑有限缓存的串联生产系统维护调度模型的基础上,提供3种不同的策略对维护进行调度;维护调度演示模块基于Flexsim。基于该平台,可完成维护调度参数分析、维护调度策略分析、维护调度仿真等实验,并可在此平台基础上建立维护调度相关参数优化模型。     

Multitasking scheduling problems with a rate-modifying activity

Motivated by the behavioral phenomena that occur while human operators are carrying out tasks, we study multitasking scheduling problems with a rate-modifying activity. In the problems, the processing of a selected task suffers from interruptions by other tasks that are available but unfinished, and the human operators regularly engage rest breaks during work shifts allowing them to recover or mitigate some of the negative effects of fatigue. The objectives are to respectively minimize: makespan, total completion time, maximum lateness, and due-date assignment related cost by determining when to schedule the rate modifying activity and the optimal task sequence in the presence of multitasking. Scheduling models and algorithms are proposed to solve the problems. The numerical examples are presented to illustrate the theorems and algorithms.     

A desired load distribution model for scheduling of unrelated parallel machines

Scheduling problems concern the allocation of limited resources over time among both parallel and sequential activities. Load balancing has been adopted as an optimization criterion for several scheduling problems. However, in many practical situations, a load-balanced solution may not be feasible or attainable. To deal with this limitation, this paper presents a generic mathematical model of load distribution for resource allocation, called desired load distribution (DLD). The objective is to develop a DLD model for scheduling of unrelated parallel machines that can be used both in centralized resource management settings and in agent-based distributed scheduling systems. The paper describes the proposed DLD model in details, presents a dynamic programming based optimization algorithm for the proposed model, and then discusses its application to agent-based distributed scheduling.     

混合流程型企业主生产计划的启发式算法

提出了一个新的启发式算法,该启发式算法称为多目标主生产计划算法(MOMPS),用于解决混合流水线车间的主生产计划安排,该启发式算法主要有以下目标:最小化拖期惩罚,最小化完工时间,最小化装设和库存成本等.该算法先对所有的定单进行排序,然后根据最小生产成本树及其该树的最大生产能力进行定单的分配,如果定单数量超出了最大生产能力,对生产网络进行调整,通过比较次优生产成本树和拖期以后的最小生产成本决定定单是否该拖期.最后通过和一般的线性规划进行比较,得出该算法在解决混合流程型企业的多目标主生产计划的制定中十分有效,有时得到的结果和线性规划模型解出的解是一致的.     

Distributed task scheduling and human resource distribution in industrial service solution production: a simulation application

This paper provides a simulation model for scheduling service task operations and distributing related human resources in dispersed work centres. The managerial concern for the minimisation of temporal overhead costs of task operations in the face of fluctuating, short-term service demands is examined under restrictions imposed by resource availability, work hour flexibility and task-backlog fulfilment. Scheduling strategies are developed directly from the constrained reduction of temporal overheads of appointment and release operations in distributed, non-interlinked work centres. To ensure the model’s structural validity, simulated task backlogs are adjusted to the actual backlog-reducing procedures in real applications. The model provides means for setting up balanced work schedules that can greatly lower temporal overheads of appointment and release operations if workers are selected in accordance with compatible time availability and task qualifications. Direct comparisons of worker productivities in the different centres can also be made, allowing managers to locate bottleneck points of service operations when productivity falls short of desired expectations. The robustness of the model is ensured by finding significant parameter domains through Monte Carlo simulations, centred on data points collected from real-time demand functions in actual service operations.     

考虑资源成本的Petri网在FMS调度中的应用

本文针对目前基于petri网的调度方法中调度目标单一的缺点，通过在petri网的结构中引入资源成本元素的方法，使得在调度计划产生的过程中可以同时考虑时间和资源成本优化，为企业作出更为科学合理的生产决策提供依据．最后通过一个实例来验证了提出的算法。     

Secure Multifactor Remote Access User Authentication Framework for IoT Networks

The term IoT refers to the interconnection and exchange of data among devices/sensors. IoT devices are often small, low cost, and have limited resources. The IoT issues and challenges are growing increasingly. Security and privacy issues are among the most important concerns in IoT applications, such as smart buildings. Remote cybersecurity attacks are the attacks which do not require physical access to the IoT networks, where the attacker can remotely access and communicate with the IoT devices through a wireless communication channel. Thus, remote cybersecurity attacks are a significant threat. Emerging applications in smart environments such as smart buildings require remote access for both users and resources. Since the user/building communication channel is insecure, a lightweight and secure authentication protocol is required. In this paper, we propose a new secure remote user mutual authentication protocol based on transitory identities and multi-factor authentication for IoT smart building environment. The protocol ensures that only legitimate users can authenticate with smart building controllers in an anonymous, unlinkable, and untraceable manner. The protocol also avoids clock synchronization problem and can resist quantum computing attacks. The security of the protocol is evaluated using two different methods: (1) informal analysis; (2) model check using the automated validation of internet security protocols and applications (AVISPA) toolkit. The communication overhead and computational cost of the proposed are analyzed. The security and performance analysis show that our protocol is secure and efficient.