Search results for "scheduling."
showing 10 items of 270 documents
On solving single elevator-like problems using a learning automata-based paradigm
2020
This paper concentrates on a host of problems with characteristics similar to those that are related to moving elevators within a building. These are referred to as Elevator-like problems (ELPs), and their common phenomena will be expanded on in the body of the paper. We shall resolve ELPs using a subfield of AI, namely the field of learning automata (LA). Rather than working with the well-established mathematical formulations of the field, our intention is to use these tools to tackle ELPs, and in particular, those that deal with single “elevators” moving between “floors”. ELPs have not been tackled before using AI. In a simplified domain, the ELP involves the problem of optimizing the sch…
Simulation-Based Performance Study of e-Commerce Web Server System – Results for FIFO Scheduling
2013
The chapter concerns the issue of overloaded Web server performance evaluation using a simulation-based approach. We focus on a Business-to-Consumer (B2C) environment and consider server performance both from the perspective of computer system efficiency and e-business profitability. Results of simulation experiments for the Web server system under First-In-First-Out (FIFO) scheduling are discussed. Much attention has been paid to the analysis of the impact of a limited server system capacity on business-related performance metrics.
Web Server Support for e-Customer Loyalty through QoS Differentiation
2013
The paper deals with the problem of offering predictive service in e-commerce Web server systems under overload. Due to unpredictability of Web accesses, such systems often fail to effectively handle peak traffic, which results in long delays and incomplete transactions. As a consequence, online retailers miss an opportunity to attract new customers, retain the loyalty of regular customers, and increase profits. We propose a method for priority-based admission control and scheduling of requests at the Web server system in order to differentiate Quality of Service (QoS) with regard to user-perceived delays, i.e., Web page response times provided by the system (as opposed to HTTP request resp…
Link scheduling in sensor networks for asymmetric average consensus
2012
Wireless Sensor Networks constitute a recent technology where the nodes cooperate to obtain, in a totally distributed way, certain function of the sensed data. One example is the average consensus algorithm, which allows every node to converge to the global average. However, this algorithm presents two major drawbacks in practice. The first one is that instantaneous symmetric links are required, which are hard to ensure in practice because of the presence of wireless interferences. The second one is that all the nodes are required to communicate with all of their local neighbors in every iteration, which can lead to an unbounded delay. In order to solve these issues, we propose a novel link…
Ensuring the QoS requirements in 802.16 scheduling
2006
IEEE 802.16 standard defines the wireless broadband access network technology called WiMAX. WiMAX introduces several interesting advantages, and one of them is the support for QoS at the MAC level. For these purposes, the base station must allocate slots based on some algorithm. We propose a simple, yet efficient, solution for the WiMAX base station that is capable of allocating slots based on the QoS requirements, bandwidth request sizes, and the WiMAX network parameters. To test the proposed solution, we have implemented the WiMAX MAC layer in the NS-2 simulator. Several simulation scenarios are presented that demonstrate how the scheduling solution allocates resources in various cases. S…
A New Universal-Environment Adaptive Multi-processor Scheduler for Autonomous Cyber-Physical System
2012
International audience; Robot, spaceship and other applications that can be called autonomous Cyber-Physical Systems (CPS) are all smart embedded systems, which usually run in open environment by themselves with inhered intelligent capabilities. Besides the application intelligence, the researches of adaptive platform for such systems have also become topics recently. Based on the analysis of current work, a new environment adaptive scheduler (¦Á-S) for multiprocessor platform of a cyber-physical system is proposed in this article. And then, its related structures, models, and reasoning methods are studied deeply. Different from the existing ones, ¦Á-S can schedule all tasks according to th…
Design of a Real-time face detection parallel architecture using High-Level Synthesis
2008
Abstract We describe a High-Level Synthesis implementation of a parallel architecture for face detection. The chosen face detection method is the well-known Convolutional Face Finder (CFF) algorithm, which consists of a pipeline of convolution operations. We rely on dataflow modelling of the algorithm and we use a high-level synthesis tool in order to specify the local dataflows of our Processing Element (PE), by describing in C language inter-PE communication, fine scheduling of the successive convolutions, and memory distribution and bandwidth. Using this approach, we explore several implementation alternatives in order to find a compromise between processing speed and area of the PE. We …
Scheduling independent stochastic tasks on heterogeneous cloud platforms
2019
International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
2014
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation…