Distributed operating systems

Tanenbaum, Andrew S.; Renesse, Robbert van

doi:10.1145/6041.6074

Cited by 620 publications

(286 citation statements)

References 63 publications

Supporting

Mentioning

214

Contrasting

Unclassified

Order By: Relevance

“…Because of its simplicity and its relatively good performance, several variations of the FF algorithm have been tested in this study. It is difficult to track down the origin of those algorithms, so the reader is referred to Tanenbaum's work [17] for their description.…”

Section: Related Workmentioning

confidence: 99%

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Jiménez

Vilanova²,

Gelado³

et al. 2009

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

Abstract. Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Combining the CPU and the GPU brings great amounts of processing power. However, such architectures are often used in a restricted way for domain-specific applications like scientific applications and games, and they tend to be used by a single application at a time. We envision future heterogeneous computing systems where all their heterogeneous resources are continuously utilized by different applications with versioned critical parts to be able to better adapt their behavior and improve execution time, power consumption, response time and other constraints at runtime. Under such a model, adaptive scheduling becomes a critical component. In this paper, we propose a novel predictive user-level scheduler based on past performance history for heterogeneous systems. We developed several scheduling policies and present the study of their impact on system performance. We demonstrate that such scheduler allows multiple applications to fully utilize all available processing resources in CPU/GPUlike systems and consistently achieve speedups ranging from 30% to 40% compared to just using the GPU in a single application mode.

show abstract

Section: Related Workmentioning

confidence: 99%

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Jiménez

Vilanova²,

Gelado³

et al. 2009

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

show abstract

“…This requirement has been called Thread Efficiency. Blocking concurrent threads for a resource represents a slow-down in the overall speed-up of the MT application leading to a sub-optimal result [6].…”

Section: Pos(acat08)044mentioning

confidence: 99%

The DAQ/HLT system of the ATLAS experiment

Anjos¹,

Abolins²,

Achenbach³

et al. 2009

Proceedings of XII Advanced Computing and Analysis Techniques in Physics Research — PoS(ACAT08)

View full text Add to dashboard Cite

The DAQ/HLT system of the ATLAS experiment at CERN, Switzerland, is being commissioned for first collisions in 2009. Presently, the system is composed of an already very large farm of computers that accounts for about one-third of its final event processing capacity. Event selection is conducted in two steps after the hardware-based Level-1 Trigger: a Level-2 Trigger processes detector data based on regions of interest (RoI) and an Event Filter operates on the full event data assembled by the Event Building system. The detector read out is fully commissioned and can be operated at its full design capacity. This places the responsibility on the High-Level Triggers system to select only events of highest physics interest that will finally reach the offline reconstruction farms. This paper brings an overview of the current ATLAS DAQ/HLT implementation and performance based on studies originated from its operation with simulated, cosmic particles and first-beam data. Its built-in event processing parallelism is presented and discussed.

show abstract

“…To do this, it is necessary to incorporate into the channel, the client used to create it (18) and then register that client as a consumer (19). The rest of the work must be implemented inside the program of this consumer (Consumer X).…”

Section: Adding the Logfile Component To The Whiteboardmentioning

confidence: 99%

Designing the Communications Infrastructure of Groupware Systems

Ochoa

Guerrero

Fuller

et al. 2002

Groupware: Design, Implementation, and Use

View full text Add to dashboard Cite

Abstract. In the development of groupware systems a well designed communications infrastructure is required, due to the high complexity of the communication scenario. Also, the design and implementation of coordination and collaboration mechanisms depends on the communications infrastructure. Actually there are no well known guidelines to design this infrastructure. Therefore, this paper proposes an architectural pattern that helps carry out the design of this communications infrastructure. The proposed pattern supports all the groupware systems communication scenarios, taking in account their particularities. This pattern has been used in the design of several groupware applications and a groupware framework with very good results.

show abstract

Distributed operating systems

Cited by 620 publications

References 63 publications

Predictive Runtime Code Scheduling for Heterogeneous Architectures

Predictive Runtime Code Scheduling for Heterogeneous Architectures

The DAQ/HLT system of the ATLAS experiment

Designing the Communications Infrastructure of Groupware Systems

Contact Info

Product

Resources

About