Sciweavers

20638 search results - page 423 / 4128
» Computer Networks
Sort
View
TAAS
2008
70views more  TAAS 2008»
15 years 6 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
AINA
2007
IEEE
16 years 1 months ago
Mobile Agents and the Deus Ex Machina
This paper aims to examine the benefits the introduction of trusted computing can bring to the mobile agent paradigm, with a specific emphasis on mobile agent security.
Shane Balfe, Eimear Gallery
ICDCSW
2007
IEEE
16 years 1 months ago
Using stream queries to measure communication performance of a parallel computing environment
We have developed a data stream management system that supports declarative stream queries running over high data volumes in a supercomputing environment. To enable specification ...
Erik Zeitler, Tore Risch

Publication
1286views
17 years 4 months ago
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitativel...
R. Jain, D. Chiu, and W. Hawe