Sciweavers

7133 search results - page 407 / 1427
» Communication algorithms with advice
Sort
View
PODC
2010
ACM
15 years 10 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
PVM
2010
Springer
15 years 5 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
RSP
2005
IEEE
131views Control Systems» more  RSP 2005»
16 years 12 days ago
Models for Embedded Application Mapping onto NoCs: Timing Analysis
Networks-on-chip (NoCs) are an emergent communication infrastructure, which can be designed to deal with growing system complexity and technology evolution. The efficient use of N...
César A. M. Marcon, Márcio Eduardo K...
AGENTS
2001
Springer
15 years 11 months ago
Monitoring deployed agent teams
Recent years are seeing an increasing need for on-line monitoring of deployed distributed teams of cooperating agents, e.g., for visualization, or performance tracking. However, i...
Gal A. Kaminka, David V. Pynadath, Milind Tambe
WETICE
2005
IEEE
16 years 12 days ago
Evaluation of an awareness distribution mechanism: A simulation approach
In distributed software engineering, the role of informal communication is frequently overlooked. Participants simply employ their own ad-hoc methods of informal communication. Co...
David Nutter, Cornelia Boldyreff