Sciweavers

2110 search results - page 23 / 422
» What is the complexity of a distributed computing system
Sort
View
ICDCS
1993
IEEE
13 years 11 months ago
Maintaining Information about Persistent Replicated Objects in a Distributed System
The paper presents a general model for persistent replicated object management and identifies what meta information about objects needs to be maintained by a naming and binding se...
Mark C. Little, Daniel L. McCue, Santosh K. Shriva...
ISORC
2008
IEEE
14 years 1 months ago
On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded Systems
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
IPPS
1998
IEEE
13 years 11 months ago
A Development Tool Environment for Configuration, Build, and Launch of Complex Applications
The increasing size and complexity of high-performance applications have motivated a new round of innovation related to configuration, build, and launch of applications for large ...
Mike Krueger
DASFAA
2004
IEEE
110views Database» more  DASFAA 2004»
13 years 11 months ago
Optimising Mediator Queries to Distributed Engineering Systems
Data and computations of a CAD system have been wrapped by a mediator system using CORBA's IIOP Protocol. This allows ad hoc declarative mediator queries to be translated into...
Mattias Nyström, Tore Risch
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...