Suboptimal RED feedback control for buffered TCP flow dynamics in computer network.
Synthesis of space-time optimal systolic algorithms for the Cholesky factorization.
The complexity of short schedules for uet bipartite graphs
The complexity of short schedules for uet bipartite graphs
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
The MX/M/1 queue with working breakdown
In this paper, we consider a batch arrival MX/M/1 queue model with working breakdown. The server may be subject to a service breakdown when it is busy, rather than completely stoping service, it will decrease its service rate. For this model, we analyze a two-dimensional Markov chain and give its quasi upper triangle transition probability matrix. Under the system stability condition, we derive the probability generating function (PGF) of the stationary queue length, and then obtain its stochastic...
The quantum size and waiting time for time-shared systems
Transfert de charge dans un réseau de processeurs totalement connectés
Transfert de Charge dans un Réseau de Processeurs Totalement Connectés
In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...
Transient analysis of a queue with queue-length dependent map and its application to SS7 network.
Transparent Scheduling of Composite Web Services
Composite Web Services (CWS) aggregate multiple Web Services in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic and other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time performance under...
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
Nous montrons qu’une priorité dynamique particulière allouée aux tâches dans un système d’exploitation d’ordinateurs multitâches s’interprète comme deux problèmes d’ordonnancement particuliers, l’ordonnancement de tâches détériorantes à durée opératoires variables et de tâches en retard ou en attente de réparation de la machine. Deux propositions sur son comportement sont énoncées. Sous certaines conditions nous montrons qu’elle est une règle d’indice. Pour le faire, nous présentons l’outil des...
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
We show that a particular dynamic priority given to jobs in a multitasks operating system of computers is a deteriorating jobs or a delaying jobs scheduling. Under some assumptions we also show that it is an index rule. To do this, we present the tool of bandit processes to solve stochastic scheduling problems on a single machine.
Using a vision cognitive algorithm to schedule virtual machines
Worst case analysis of two heuristics for the set partitioning problem
Об оптимальных расписаниях с прерываниями для независимых работ в системе обслуживания с N приборами
Оценка задержек при приоритетном обслуживании в управляющей вычислительной системе