Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
Scheduling multiprocessor tasks on two parallel processors
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
Scheduling multiprocessor tasks on two parallel processors
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
Scheduling precedence task graphs with disturbances
In this paper we consider the problem of scheduling precedence task graphs in parallel processing where there can be disturbances in computation and communication times. Such a phenomenon often occurs in practice, due to our inability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to such changes...
Scheduling Precedence Task Graphs with Disturbances
In this paper we consider the problem of scheduling precedence task graphs in parallel processing where there can be disturbances in computation and communication times. Such a phenomenon often occurs in practice, due to our inability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to such...
Scheduling UET trees with communication delays on two processors
Scheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors. The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non UECT tasks.
Secuenciación dinámica de sistemas de fabricación flexible mediante aprendizaje automático: análisis de los principales sistemas de secuenciación existentes.
Una forma habitual de secuenciar de modo dinámico los trabajos en los sistemas de fabricación es mediante el empleo de reglas de secuenciación. Sin embargo, el problema que presenta este método es que el comportamiento del sistema de fabricación dependerá de su estado, y no existe una regla que supere a las demás en todos los posibles estados que puede presentar el sistema de fabricación. Por lo tanto, sería interesante usar en cada momento la regla más adecuada. Para lograr este objetivo, se pueden...
Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows
Discrete-continuous project scheduling problems with positive discounted cash flows and the maximization of the NPV are considered. We deal with a class of these problems with an arbitrary number of discrete resources and one continuous, renewable resource. Activities are nonpreemptable, and the processing rate of an activity is a continuous, increasing function of the amount of the continuous resource allotted to the activity at a time. Three common payment models – Lump Sum Payment, Payments at...
Simulation of transient performance measures for stiff Markov chains
Simulation of transient performance measures for stiff markov chains
We consider the simulation of transient performance measures of high reliable fault-tolerant computer systems. The most widely used mathematical tools to model the behavior of these systems are Markov processes. Here, we deal basically with the simulation of the mean time to failure (MTTF) and the reliability, R(t), of the system at time t. Some variance reduction techniques are used to reduce the simulation time. We will combine two of these techniques: Importance Sampling and Conditioning...
Solving a permutation problem by a fully polynomial-time approximation scheme
For a problem of optimal discrete control with a discrete control set composed of vertices of an n-dimensional permutohedron, a fully polynomial-time approximation scheme is proposed.
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some performance measures for vacation models with a batch Markovian arrival process.
Spectral Recognition of Graphs
Stability and throughput improvement for multichannel CSMA and CSMA/CD protocols with optimal bandwidth allocation
This paper examines appropriate protocols for high speed multiple access communication systems where the bandwidth is divided into two separate asymmetric channels. Both channels operate using slotted non-persistent CSMA or CSMA/CD techniques. Free stations access the first channel while all retransmissions occur in the second channel. We define the stability regions and the rules for optimal bandwidth allocation among the two channels for improvement of the system performance in case of infinite...
Stability of queueing network system with two stations and classes.
Stability of queueing networks.
Statistical methods in measuring search engine performance.