Tight bounds for quasirandom rumor spreading.
Token transfer in a faulty network
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...
Two open problems in communication in edge-disjoint paths modes
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
Visualizing interdomain routing with BGPlay.
Worst case analysis of two heuristics for the set partitioning problem
Об оптимальных расписаниях с прерываниями для независимых работ в системе обслуживания с N приборами
Остовной алгоритм построения потоков в БКВ
Оценка задержек при приоритетном обслуживании в управляющей вычислительной системе