Displaying similar documents to “Two short presentations for Lyons' sporadic simple group.”

Scheduling UET Trees with Communication Delays on two Processors

Frederic Guinand, Denis Trystman (2010)

RAIRO - Operations Research

Similarity:

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.

Communication Complexity And Linearly Ordered Sets

Mieczysław Kula, Małgorzata Serwecińska (2015)

Annales Mathematicae Silesianae

Similarity:

The paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to O(log2 n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of...

Parallel machine scheduling with uncertain communication delays

Aziz Moukrim, Eric Sanlaville, Frédéric Guinand (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model...

The communication hierarchy of time and space bounded parallel machines

Norbert Popély (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We describe the communicating alternating machines and their simulation. We show that, in the case of communicating alternating machines which are bounded, simultaneously, by polynomial time and logarithmic space, the use of three communication levels instead of two does not increase computational power of communicating alternating machines. This resolves an open problem [2] concerning the exact position of machines with three communication levels in the hierarchy.

Scheduling Precedence Task Graphs with Disturbances

Apurv Gupta, Gilles Parmentier, Denis Trystram (2010)

RAIRO - Operations Research

Similarity:

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...

Construction of Very Hard Functions for Multiparty Communication Complexity

Ján Maňuch (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider the multiparty communication model defined in [4] using the formalism from [8]. First, we correct an inaccuracy in the proof of the fundamental result of [6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, , functions such that those as well as their complements have the worst possible nondeterministic communication complexity. The problem to find a particular very hard function...