Sciweavers

174 search results - page 32 / 35
» Using Rerouting to Improve Aggregate Based Resource Allocati...
Sort
View
ECAI
1998
Springer
15 years 1 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
CIDR
2003
147views Algorithms» more  CIDR 2003»
14 years 11 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
P2PKM
2004
14 years 11 months ago
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...
Fred S. Annexstein, Kenneth A. Berman
CORR
2011
Springer
164views Education» more  CORR 2011»
14 years 1 months ago
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, ...
SLIP
2003
ACM
15 years 2 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...