Sciweavers

1443 search results - page 191 / 289
» Improving the Performance of Distributed CORBA Applications
Sort
View
GCC
2007
Springer
15 years 11 months ago
Detecting and Reducing Partition Nodes in Limited-routing-hop Overlay Networks
Many Internet applications use overlay networks as their basic facilities, like resource sharing, collaborative computing, and so on. Considering the communication cost, most over...
Zhenhua Li, Guihai Chen
MIDDLEWARE
2007
Springer
15 years 11 months ago
The case for aspect-oriented reflective middleware
The emergence of applications domains such as pervasive and autonomic computing has increased the need for customisation and dynamic adaptation of both distributed systems, and th...
Paul Grace, Eddy Truyen, Bert Lagaisse, Wouter Joo...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 10 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
SPAA
1998
ACM
15 years 9 months ago
Elimination Forest Guided 2D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
Kai Shen, Xiangmin Jiao, Tao Yang
SPAA
1994
ACM
15 years 9 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher