We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. S...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
Clusters of SMPs are becoming increasingly common. However, the shared memory design of SMPs and the consequential contention between system processors for access to main memory c...
We describe the integration of smart digital objects with Hebbian learning to create a distributed, real-time, scalable approach to adapting to a community's preferences. We ...
Thomas Lutkenhouse, Michael L. Nelson, Johan Bolle...