#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1948

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

- Heinrich Moser, Ulrich Schmid
- OPODIS
- 2006

This paper 1 introduces a simple real-time distributed computing model for message-passing systems , which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration, we obtain a model that both facilitates real-time scheduling analysis and retains… (More)

- Bernd Thallner, Heinrich Moser, Ulrich Schmid
- Wireless Networks
- 2010

Fault-tolerant communication and energy efficiency are important requirements for future-generation wireless ad hoc networks, which are increasingly being considered also for critical application domains like embedded systems in automotive and aerospace. Topology control, which enables multi-hop communication between any two network nodes via a suitably… (More)

- Bernd Thallner, Heinrich Moser
- Third International Workshop on Intelligent…
- 2005

Energy efficiency and fault-tolerance are the most important issues in the development of next-generation wireless ad hoc networks and sensor networks. Topology control as a low level service (typically below the traditional layer structure) governs communication among all nodes and is hence the primary target for increasing connectivity and saving energy.… (More)

- Heinrich Moser
- Theor. Comput. Sci.
- 2009

This paper 1 introduces a simple real-time distributed computing model for message-passing systems, which reconciles the distributed computing and the real-time systems perspective: By just replacing instantaneous computing steps with computing steps of non-zero duration , we obtain a model that both facilitates real-time scheduling analysis and retains… (More)

- Heinrich Moser, Bernd Thallner
- DIWANS '06
- 2006

This paper presents a proven correct implementation of a distributed topology construction algorithm based upon agreement on minimal-weight clusters for creating a k - regular, k -node connected fault-tolerant communication network. It adapts to crashing nodes, moving nodes and changing communication cost and is guaranteed to converge. We analyze the… (More)

- Heinrich Moser, Ulrich Schmid
- OPODIS
- 2008

In an OPODIS'06 paper, we laid down the foundations of a real-time distributed computing model (RT-Model) with non-zero duration computing steps, which reconciles correctness proofs and real-time schedulability analysis of distributed algorithms. By applying the RT-Model to the well-known drift-free internal clock synchronization problem, we proved that… (More)

- Sam Eldabe, Katja Burger, +7 authors Jeyakumar Subbaroyan
- Neuromodulation : journal of the International…
- 2015

OBJECTIVES
Phantom limb pain (PLP) is a neuropathic condition in which pain is perceived as arising from an amputated limb. PLP is distinct from, although associated with, pain in the residual limb and nonpainful phantom sensations of the missing limb. Its treatment is extremely challenging; pharmaceutical options, while commonly employed, may be… (More)

- Heinrich Moser, Ulrich Schmid
- Distributed Computing
- 2011

We present generic transformations, which allow to translate classic fault-tolerant distributed algorithms and their correctness proofs into a real-time distributed computing model (and vice versa). Owing to the non-zero-time, non-preemptible state transitions employed in our real-time model, scheduling and queuing effects (which are inherently abstracted… (More)

- Heinrich Moser
- 2002

Starting with the very first evaluator, implemented as a thousand-line BASIC program in 1972, Smalltalk was the first computer language based entirely on objects and messages. This paper gives an overview of Smalltalk and some of the design issues Smalltalk implementors had to face.

This master's thesis presents a proven-correct implementation of a distributed topology construction algorithm based upon the Thallner topology construction method for creating a minimal ∆-node connected fault-tolerant overlay graph. The algorithm works in asynchronous fault-tolerant distributed systems augmented with failure detectors. A detailed proof… (More)