http://compalg.inf.elte.hu/~tony/Kutatas/BinPacking/Johnson-BinPacking-NP-Column-JAlg-2002.pdf

The NP-completeness column: An ongoing guide

Four different communication problems are addressed in Boolean n-cube configured multiprocessors: (1) one-to-all broadcasting: distribution of common data from a single source to all other nodes; (2) one-to-all personalized communication: a single node sending unique data to all other nodes; (3) all-to-all broadcasting: distribution of common data from each node to all other nodes; and (4) all-to-all personalized communication: each node sending a unique piece of information to every other node. Three communication graphs (spanning trees) for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed. With appropriate scheduling and concurrent communication on all ports of every processor, routings based on these two communication graphs offer a speedup of up to n/2, and O( square root n) over the routings based on the spanning binomial tree for cases (2)-(4) respectively. All three spanning trees offer optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor. Timing models and complexity analysis are verified by experiments on a Boolean-cube-configured multiprocessor. >

Optimum broadcasting and personalized communication in hypercubes

Kurskod: 5DV050 Inrättad: 2008-03-31 Inrättad av: teknisk-naturvetenskapliga fakultetsnämnden Reviderad: 2012-02-29 Reviderad av: teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskap Huvudområden och successiv fördjupning: Beräkningsteknik: Avancerad nivå, har endast kurs/er på grundnivå som förkunskapskrav (A1N) , Datavetenskap: Avancerad nivå, har endast kurs/er på grundnivå som förkunskapskrav (A1N) Betygsskala: För denna kurs ges betygen 5 Med beröm godkänd, 4 Icke utan beröm godkänd, 3 Godkänd, VG Väl godkänd, G Godkänd, U Underkänd Utbildningsnivå: Avancerad nivå

The design and analysis of parallel algorithms

The class NC consists of problems solvable very fast (in time polynomial in log n ) in parallel with a feasible (polynomial) number of processors. Many natural problems in NC are known; in this paper an attempt is made to identify important subclasses of NC and give interesting examples in each subclass. The notion of NC 1 -reducibility is introduced and used throughout (problem R is NC 1 -reducible to problem S if R can be solved with uniform log-depth circuits using oracles for S ). Problems complete with respect to this reducibility are given for many of the subclasses of NC . A general technique, the “parallel greedy algorithm,” is identified and used to show that finding a minimum spanning forest of a graph is reducible to the graph accessibility problem and hence is in NC 2 (solvable by uniform Boolean circuits of depth O (log 2 n ) and polynomial size). The class LOGCFL is given a new characterization in terms of circuit families. The class DET of problems reducible to integer determinants is defined and many examples given. A new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph. This paper is a revised version of S. A. Cook, (1983, in “Proceedings 1983 Intl. Found. Comut. Sci. Conf.,” Lecture Notes in Computer Science Vol. 158, pp. 78–93, Springer-Verlag, Berlin/New York).

A taxonomy of problems with fast parallel algorithms

Diverse proprietary network appliances increase both the capital and operational expense of service providers, meanwhile causing problems of network ossification. Network function virtualization (NFV) is proposed to address these issues by implementing network functions as pure software on commodity and general hardware. NFV allows flexible provisioning, deployment, and centralized management of virtual network functions. Integrated with SDN, the software-defined NFV architecture further offers agile traffic steering and joint optimization of network functions and resources. This architecture benefits a wide range of applications (e.g., service chaining) and is becoming the dominant form of NFV. In this survey, we present a thorough investigation of the development of NFV under the software-defined NFV architecture, with an emphasis on service chaining as its application. We first introduce the software-defined NFV architecture as the state of the art of NFV and present relationships between NFV and SDN. Then, we provide a historic view of the involvement from middlebox to NFV. Finally, we introduce significant challenges and relevant solutions of NFV, and discuss its future research directions by different application domains.

Software-Defined Network Function Virtualization: A Survey

Matrix multiplication algorithms for cube connected and perfect shuffle computers are presented. It is shown that in both these models two $n \times n$ matrices can be multiplied in $O(n/m + \log m)$ time when $n^2 m$, $1 \leqq m \leqq n$, processing elements (PEs) are available. When only $m^2 $, $1 \leqq m \leqq n$, PEs are available, two $n \times n$ matrices can be multiplied in $O(n^2/m + m(n/m)^{2.61} )$ time. It is shown that many graph problems can be solved efficiently using the matrix multiplication algorithms.

Parallel Matrix and Graph Algorithms

A parallel matching algorithm for convex bipartite graphs and applications to scheduling

Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.

Parallel Scheduling Algorithms

A method for storing multiple types of information, the method includes: storing information representative of a content of a persistent memory entity at a certain point in time; and storing information representative of a state of a virtual machine at the certain point in time. A computer program product including a computer usable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to: store information representative of a content of a persistent memory entity at a certain point in time; and store information representative of a state of a virtual machine at the certain point in time.

System, method and computer program product for storing multiple types of information

Methods, apparatus, and products are disclosed for reliable messaging using redundant message streams in a high speed, low latency data communications environment that include brokering, by a stream administration server, establishment of an active message stream to a subscribing client device from an active feed adapter, the active message stream capable of communicat ing active application messages; brokering, by the server, establishment of a backup message stream to the subscribing client device from a backup feed adapter, the backup message stream capable of communicating backup application messages representing duplicates of the active messages; receiving the active messages in messaging middleware of the subscribing client device; receiving, in response to a failover, the backup messages in the messaging middleware; and administering, by the messaging middleware, the backup messages in dependence upon an active stream source identifier, an active stream source sequence number, a backup stream source identifier, and a backup stream source sequence number.

Eliezer Dekel

Papers

Parallel Matrix and Graph Algorithms

A parallel matching algorithm for convex bipartite graphs and applications to scheduling

Parallel Scheduling Algorithms

System, method and computer program product for storing multiple types of information

Reliable messaging using redundant message streams in a high speed, low latency data communications environment