Sciweavers

2092 search results - page 207 / 419
» Dynamically Distributed Query Evaluation
Sort
View
135
Voted
CLUSTER
2001
IEEE
15 years 7 months ago
Adaptive Runtime Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive, system sensitive partitioning and load balancing framework for distributed structured adaptive mesh refinement applic...
Shweta Sinha, Manish Parashar
110
Voted
NOCS
2007
IEEE
15 years 10 months ago
A Hybrid Analog-Digital Routing Network for NoC Dynamic Routing
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
Terrence S. T. Mak, N. Pete Sedcole, Peter Y. K. C...
132
Voted
ICDCS
1998
IEEE
15 years 7 months ago
Optimal Channel Allocation for Data Dissemination in Mobile Computing Environments
This paper discusses wireless channel allocation problem for data dissemination in mobile computing systems. Methods for accessing data through broadcast and on-demand channels ar...
Qinglong Hu, Dik Lun Lee, Wang-Chien Lee
180
Voted
PODC
2011
ACM
14 years 6 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
150
Voted
SEBD
1997
158views Database» more  SEBD 1997»
15 years 5 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...