Sciweavers

8493 search results - page 1629 / 1699
» Implementing a distributed firewall
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 2 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
DEXA
2000
Springer
132views Database» more  DEXA 2000»
14 years 2 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
ICFP
1999
ACM
14 years 2 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
INFOCOM
1999
IEEE
14 years 2 months ago
An Architecture for Noncooperative QoS Provision in Many-Switch Systems
With the proliferation of high-speed networks and networked services, provisioning differentiated services to a diverse user base with heterogeneous QoS requirements has become an ...
Shaogang Chen, Kihong Park
ISCA
1999
IEEE
95views Hardware» more  ISCA 1999»
14 years 2 months ago
Memory Sharing Predictor: The Key to a Speculative Coherent DSM
Recent research advocates using general message predictors to learn and predict the coherence activity in distributed shared memory (DSM). By accurately predicting a message and t...
An-Chow Lai, Babak Falsafi
« Prev « First page 1629 / 1699 Last » Next »