Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communication buffering and strobing. With communication buffering, communication generated by each processor is buffered and performed at the end of regular intervals to amortize communication and scheduling overhead. This inf...

– As parallel library standards make it easier to use clusters of workstations for large computational jobs, concentration must be placed on the underlying communication mechanism used by the library. Also, with dynamic resource allocation schemes and task migration, it is now possible to move tasks in mid–execution to exploit architectures that offer faster communication networks. This paper d...

Teaching a course on optimizing online communication behavior and social network analysis permitted us to obtain preliminary results on correlating temporal online communication patterns with team performance. Students from Helsinki University of Technology and University of Cologne who had never met face to face formed virtual interdisciplinary teams collaborating on a common task. While colla...

This paper explores collective personalized communication. For example, in all-to-all personalized communication (AAPC), each processor sends a distinct message to every other processor. However, for many applications, the collective communication pattern is many-to-many, where each processor sends a distinct message to a subset of processors. In this paper we first present strategies that redu...

Since renewable energies have been and will be massively integrated, electrical power grids require more refined generation dispatch modes and smarter communication methods. In this paper, the real-time generation dispatch and communication architecture of smart grid with renewable energy are studied. Firstly, the technical characteristics and application background of smart grid communication ...

This paper focuses on the problem of locality optimizations for high-performance uniprocessor and multiprocessor systems. It shows that the problems of minimizing interprocessor communication and optimizing cache locality can be formulated in a similar manner. It outlines the algorithms to optimize for the various levels of the memory hierarchy simultaneously.

This paper presents an Asynchronous Team Algorithms (ATeam) implementation, in a parallel heterogeneous asynchronous environment, to optimize the design of reliable communication networks given the set of nodes an possible links. The proposed Team combines parallel genetics algorithms (GA), with different reliability calculation approaches in a network of personal computers, proving good experi...

This paper describes an educational methodology that we have implemented at the Universidad de Vigo which is based on a real competitive environment. It involves developing a communication subsystem, specified by a standard. Intercommunication between subsystems must take place successfully according to that standard. However, students are free to incorporate new features, enhance others, or op...

In this paper, we present a mathematical formulation for saving energy in fixed broadband wireless networks by selectively turning off idle communication devices in low-demand scenarios. This problem relies on a fixed-charge capacitated network design (FCCND), which is very hard to optimize. We then propose heuristic algorithms to produce feasible solutions in a short time.