Sciweavers

2924 search results - page 543 / 585
» Lower Bounds in Distributed Computing
Sort
View
JSSPP
2004
Springer
14 years 1 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
INFOCOM
2002
IEEE
14 years 19 days ago
Performance of Reliable Transport Protocol over IEEE 802.11 Wireless LAN: Analysis and Enhancement
IEEE 802.11 Medium Access Control(MAC) is proposed to support asynchronous and time bounded delivery of radio data packets in infrastructure and ad hoc networks. The basis of the I...
Haitao Wu, Yong Peng, Keping Long, Shiduan Cheng, ...
CDC
2009
IEEE
117views Control Systems» more  CDC 2009»
14 years 13 days ago
Information dissemination in networks via linear iterative strategies over finite fields
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
Shreyas Sundaram, Christoforos N. Hadjicostis
MAAMAW
1993
Springer
13 years 11 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
EPEW
2006
Springer
13 years 11 months ago
Model Checking for a Class of Performance Properties of Fluid Stochastic Models
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
Manuela L. Bujorianu, Marius C. Bujorianu