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.
It is of great importance in a WiFi network to achieve a good user experience and fair allocation of the limited bandwidth resource. In this paper we propose the design of a cross-layer AP (Access Point) centric streaming scheduler for DASH (Dynamic Adaptive Streaming over HTTP) in multirate 802.11 wireless networks. Residing at the AP, the scheduler achieves proportional fairness at the packet level...
This paper introduces a load-balancing cluster system based on Linux Virtual Server we designed for Internet-based Electrical Engineering Virtual Lab, and presents a dynamic feedback algorithm based on neural network to solve unbalanced scheduling problem and improve the performance and stability of the cluster.
As we are living in a data-driven world and directed toward internet, the need for data enter is growing. The main limitation for building cloud infrastructures is their energy consumption. Moreover, their conception is not perfect because servers are not the ones consuming all the power, cooling systems are responsible for half of the consumption. Cooling costs can be reduced by intelligent scheduling,...
In this paper we outline a novel approach for accessing mutually exclusive resources in hierarchically scheduled real-time systems. Our method known as the Resource Access Control Protocol with Preemption (RACPwP) is an improved resource allocation protocol which utilizes preemptive critical sections to provide guaranteed determinism for hard real-time tasks and comparable response times for soft...
We consider scheduling strategies for point-to-multipoint (PMP) storage area networks (SANs) that use network coded storage (NCS).We present a simple SAN system model, two server scheduling algorithms for PMP networks, and analytical expressions for internal and external blocking probability. We point to select scheduling advantages in NCS systems under normal operating conditions, where content requests...
Nowadays, there are different types of computing infrastructures, like grids and volunteer communities, which have distinct needs and the preservation of energy or other resources is chief among them. This paper presents an attempt to incorporate pluggable scheduling into an existing open-source volunteer computing system named BOINC. Our efforts proved valid, as we managed to re-engineer BOINC to...
Virtualization promised to dramatically increase server utilization levels, yet many data centers are still only lightly loaded. In some ways, big data applications are an ideal fit for using this residual capacity to perform meaningful work, but the high level of interference between interactive and batch processing workloads currently prevents this from being a practical solution in virtualized...
We design a simple and efficient online scheme for scheduling cloud tasks requesting multiple resources, such as CPU and memory. The proposed scheme reduces the queuing delay of the cloud tasks by accounting for their execution time lengths. We also derive bounds on the average queuing delays, and evaluate the performance of our proposed scheme and compare it with those achievable under existing schemes...
MapReduce has achieved tremendous success for large-scale data processing in data centers. A key feature distinguishing MapReduce from previous parallel models is that it interleaves parallel and sequential computation. Past schemes, and especially their theoretical bounds, on general parallel models are therefore, unlikely to be applied to MapReduce directly. There are many recent studies on MapReduce...
To achieve high performance, thousands of servers in cloud datacenters coordinate tasks to provide reliable and highly available cloud computing services, especially, in terms of multitasking. Effective mechanisms are now required to prepare for a failure of such computing nodes. A number of studies have been done to address this problem, but it cannot always guarantee an acceptable performance. In...
With the emerging of many data centers around the globe, heavy loads of large-scale commercial and scientific applications executed in the cloud call for efficient cloud resource management strategies to save energy without compromising the performance and system throughput. According to the statistics from the Data Centre Dynamic (DCD) organization, the expected energy consumption by computer servers...
Remote offloading techniques have been proposed to overcome the limited resources of mobile platforms by leveraging external powerful resources such as personal work-stations or cloud servers. Prior studies have primarily focused on core mechanisms for offloading. Yet, adaptive scheduling in such systems is important because offloading effectiveness can be influenced by varying network conditions,...
In this paper, we improve the performance of server-side I/O scheduling on parallel file systems by transparently including information about the applications' access patterns. Server-side I/O scheduling is a valuable tool on multiapplication scenarios, where the applications' spatial locality suffers from interference caused by concurrent accesses to the file system. We present AGIOS, an I/O scheduling...
The Transmission of multimedia content typically has bandwidth, delay and loss issues. Video compression, layer, media distribution services, streams servers, synchronization technique and synchronization protocols for streaming are major areas of research. It require scheduling protocol to sequence the events. Various useful applications for streaming in internet world are available and their implementation...
Recent years have seen a rapid increase in the use of heterogeneous distributed systems for deploying critical missions. This trend is motivated by the flexibility and great processing capabilities that such systems can offer. However, their inherent complexity makes them prone to a wide range of cyber attacks. Efficiently scheduling mission tasks under various temporal and security constraints is...
Task scheduling in a federated cloud environment is a complex problem since there are several cloud providers presenting distinct memory and storage capacities that should be addressed. This article focus on the task scheduling problem in BioNimbuZ, a federated cloud infrastructure for executing bioinformatics applications, which was previously proposed by our group. We present a scheduling algorithm...
Transparent computing has received increasing attention recently. As a variation and implementation of cloud computing, scheduling is destined to be one of the most hot topics for performance optimization. In this paper, we focus on a typical transparent computing platform, where a number of clients are connected with a server cluster in a gigabit LAN. Due to the NP-completeness of the scheduling...
We have introduced an adaptive hierarchical scheduling framework as a solution for composing dynamic realtime systems, i.e., systems where the CPU demand of its tasks are subjected to unknown and potentially drastic changes during runtime. The framework consists of a controller which periodically adapts the system to the current load situation. In this paper, we unveil and explore the detailed behavior...
In Amman, the capital city of Jordan, the transportation system is very poor and lacks organization. The only available transportation is busses and taxis. Busses do not follow time schedules and do not have designated bus stops, while taxis are available in large numbers and are more flexible than busses. This results in a high demand on taxis by customers, but unfortunately, there are no taxi parkings,...
Slot shifting is a method to combine time-triggered and event-triggered scheduling of real-time systems. It analyzes offline constructed scheduling tables for the amount and location of unused resources, called spare capacities, which are used to accommodate event-triggered activities, such as aperiodic tasks. Spare capacities are efficiently represented to indicate available resources and the flexibility...
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.