Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Two Tools for Interprocess Communication in Distributed Data-Flow Systems

Abstract is not available.

Implementation of CSP-S for description of distributed algorithms

The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.

Worst-Case Asymmetric Distributed Source Coding

We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.

Postcard distributed by M. Molling & Co., Hannover, to commemorate the 100th anniversary of Friedrich Schiller's death.

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Portrait of Henny Molling nee Meyerhof, Therese Molling and Julie Meyerhof nee Oppenheimer - three generations of women.

from left to right: Henny Molling nee Meyerhof, Therese Molling, and Julie Meyerhof nee Oppenheimer

Portrait of Henny Molling nee Meyerhof, Therese Molling and Julie Meyerhof nee Oppenheimer - three generations of women.

from left to right: Henny Molling nee Meyerhof, Therese Molling, and Julie Meyerhof nee Oppenheimer

Three generations of Therese Gottschalk nee Molling, her daughter Elizabeth Gottschalk and Grandmother Henny Molling; Hannover, Germany.

From left to right: Therese Gottschalk nee Molling, Elizabeth Gottschalk, Henny Molling

Postcard distributed by M. Molling & Co. to commemorate the 100th anniversary of Friedrich Schiller's death; Hannover, Germany. Advertisements

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Portrait of four generations of women: Henny Molling nee Meyerhof, Elizabeth Gottschalk, Julie Meyerhof nee Oppenheimer and Therese Gottschalk nee Molling Portraits; Family

From left to right: Henny Molling, born Meyerhof, Elizabeth Gottschalk, Julie Meyerhof born Oppenheimer, and Therese Gottschalk, born Molling.

Documents regarding number of recipients and amount of cash distributed; Juedische Winterhilfe der Juedische Gemeinde; Berlin Jewish Institutions

"25851 Personen betreute die Juedische Winterhilfe mit Regelleistungen. 2300 Barbeihilfen im Werte von 54000 Mark wurden an Betreute gezahlt"

Dissipativeness and Stability of a Class of Distributed Parameter Systems

Input-output stability of linear-distributed parameter systems of arbitrary order and type in the presence of a distributed controller is analyzed by extending the concept of dissipativeness, with certain modifications, to such systems. The approach is applicable to systems with homogeneous or homogenizable boundary conditions. It also helps in generating a Liapunov functional to assess asymptotic stability of the system.

Data distribution and task scheduling for distributed computing of all-to-all comparison problems

This research studied distributed computing of all-to-all comparison problems with big data sets. The thesis formalised the problem, and developed a high-performance and scalable computing framework with a programming model, data distribution strategies and task scheduling policies to solve the problem. The study considered storage usage, data locality and load balancing for performance improvement in solving the problem. The research outcomes can be applied in bioinformatics, biometrics and data mining and other domains in which all-to-all comparisons are a typical computing pattern.