Sciweavers

793 search results - page 124 / 159
» Efficient computation of the characteristic polynomial
Sort
View
IPPS
2002
IEEE
14 years 1 months ago
Predicting the Performance of Wide Area Data Transfers
As Data Grids become more commonplace, large data sets are being replicated and distributed to multiple sites, leading to the problem of determining which replica can be accessed ...
Sudharshan Vazhkudai, Jennifer M. Schopf, Ian T. F...
ICDCS
2000
IEEE
14 years 1 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
ICPADS
1998
IEEE
14 years 1 months ago
One-Phase Commit: Does it make Sense?
1 Although widely used in distributed transactional systems, the so-called Two-Phase Commit (2PC) protocol introduces a substantial delay in transaction processing, even in the abs...
Maha Abdallah, Rachid Guerraoui, Philippe Pucheral
MICRO
1998
IEEE
129views Hardware» more  MICRO 1998»
14 years 1 months ago
A Bandwidth-efficient Architecture for Media Processing
Media applications are characterized by large amounts of available parallelism, little data reuse, and a high computation to memory access ratio. While these characteristics are p...
Scott Rixner, William J. Dally, Ujval J. Kapasi, B...
NOMS
1998
IEEE
154views Communications» more  NOMS 1998»
14 years 1 months ago
A framework for end-to-end proactive network management
Current advances in networking, computing, software and web technologies have led to an explosive growth in the development of networked applications. Management of large-scale ne...
Salim Hariri, Yoonhee Kim, K. Varshney, R. Kaminsk...