The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The problem of energy consumption is topical in every sphere of human activity nowadays. This problem is especially important for IT (information technologies), where the amount of data that needs to be processed is growing every day. In this paper PCPB (Power Consumption and Performance Balance) algorithm has been proposed. It is an energy-aware scheduling algorithm which is aimed at reducing power...
New Grid and cloud solutions for distributed data mining and data processing are needed for execution of data intensive workflows. In contrast of the standard workflows, in which data between the jobs are exchanged in the form of files and the jobs are finished when they process the input data, data intensive workflows receive data organized in blocks which are streamed on inputs, analyze the data...
The problem of energy efficiency appears in every sphere of human activity. At the same time new services require higher processing and transmitting rates. In this paper, the algorithm of tasks scheduling in the server cluster PCPB — Power Consumption and Performance Balance — is presented. It is aimed to reduces the total power consumption of the server cluster without reducing its computing performance...
Regarding the problems such as long response time, unbalanced job scheduling load and low implementation efficiency of traditional distributed logistics inventory system, this article proposed the Hadoop dynamic load balance scheduling algorithm based on heartbeat feedback. According to Hadoop scheduling model and working principle of cloud computing, it analyzed the map and reducer function role...
As a distributed computing framework based on memory, Spark is being used by more and more enterprises. Generally, Spark runs in multi-user and multi-job mode, where may exist a large number of reuse of jobs. This reuse, here, refers to the calculation reuse inside the jobs, and it can greatly shorten the executing time of jobs in Spark. Therefore, this paper proposes a scheduling pool scheduling...
With the rapid development of the Internet, in the face of the rapid increase of the number of visits and more complex transaction, the network server must have a very strong network computing processing power and functionality to provide a large number of concurrent access to services. The load balancing technology of linux virtual server will undoubtedly become an effective means to solve the bottleneck...
Web server cluster has been widely used to improve web server's performance. In order to help web providers select the appropriate pair of scheduling algorithm and cache replacement algorithm, and to help researchers evaluate new scheduling algorithm or cache replacement algorithm under different client access patterns, this paper designs and implements a trace-driven scheduling algorithm and cache...
The previous works about MapReduce task scheduling with deadline constraints neither take the diffenences of Map and Reduce task, nor the cluster's heterogeneity into account. This paper proposes an extensional MapReduce Task Scheduling algorithm for Deadline constraints in Hadoop platform: MTSD. It allows user specify a job's deadline and tries to make the job be finished before the deadline. Through...
Hybrid approach for scheduling on multicore processors that can effectively integrate the advantage of global scheduling and partitioning scheduling, becoming one of the hottest issues in real-time scheduling. Meanwhile, different from single-core, multicore architecture in the form of a variety of hierarchical shared caches, efficient cache usage on multicore platforms can greatly improve the scheduling...
MapReduce is a powerful platform for large-scale data processing. To achieve good performance, a MapReduce scheduler must avoid unnecessary data transmission by enhancing the data locality (placing tasks on nodes that contain their input data). This paper develops a new MapReduce scheduling technique to enhance map task's data locality. We have integrated this technique into Hadoop default FIFO scheduler...
For parallel applications running on high-performance clusters, performance is usually satisfied without paying much attention to energy consumption. In this paper, we develop a new scheduling algorithm called Energy efficient Scheduling Algorithm based on DVS and Dynamic threshold (ESADD), which combines dynamic threshold-based task duplication strategy with dynamic voltage scaling (DVS) technique...
Data Broadcast is an effective method to solve the serious asymmetric bandwidth of the uplink and downlink in mobile real-time environment. This paper analyzes UFO algorithm and improves UFO from server sending data broadcast and mobile clients receiving data broadcast, then advances SBS algorithm and CRS algorithm. Besides, theoretical analysis and experimental results show that the 2 algorithms...
High performance heterogeneous clusters have been widely used to commercial and scientific areas. However, huge energy consumption has prevented the further application of large-scale heterogeneous clusters. It is highly desirable to design energy-aware scheduling algorithm for parallel applications running on heterogeneous clusters. In this regard, we propose a novel scheduling algorithm called Efficient-Energy...
Wireless Sensor Networks (WSN) consist of sensors that may serve a single application or multiple applications. Effective resource management is important when multiple applications share a WSN. In this research, a number of scheduling algorithms that use varying degrees of knowledge about system and application characteristics are proposed. Simulation results show how scheduling can be made more...
In mobile wireless systems, the data on air can be accessed by a large number of mobile clients. The organization of data on wireless channels, which aims to reduce the access time of clients, is a key problem in data broadcast systems. Existing algorithms for periodic data broadcasts generally make assumptions that the clients' queries are already known and/or the distribution of access frequencies...
Clusters provide powerful computing performance is at cost of huge energy consumption. Scheduling a parallel application with a set of precedence-constrained tasks on cluster is challenging because of high communication cost. Although task duplication based scheduling algorithm is applied to minimize communication overhead, most of them only consider scheduling lengths, however completely ignoring...
In this paper, a partial duplication based scheduling algorithm is designed that focuses on reducing the schedule length and processor count of the schedule by reducing the idle time slots. The proposed algorithm clusters the tasks so that it reduces the total job completion time i.e reducing the schedule length of the tasks. Then the compaction process is used to yield reduced number of processors...
In a modern chip-multiprocessor system, memory is a shared resource among multiple concurrently executing threads. The memory scheduling algorithm should resolve memory contention by arbitrating memory access in such a way that competing threads progress at a relatively fast and even pace, resulting in high system throughput and fairness. Previously proposed memory scheduling algorithms are predominantly...
Task scheduling is an important part of high performance multi-core building. The shortcomings of existing task scheduling algorithms is analyzed, and a new efficient heuristic task scheduling algorithm, namely,HCDDSL is proposed in this paper. Firstly, the new algorithm optimizes DAG graph by using clustering, then the nodes are descended by the values of Succ_sum,the task schedule has been processed...
Real-time tasks scheduling on cluster become more challenging when security requirement of application is considered. Running security algorithm on cluster to combat the security threat increases overall execution overhead. Increasing security strength causes decreasing task's acceptance ratio. In this study, we proposed a scheduling algorithm which balances this two conflicting requirements of real-time...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.