Sciweavers

1120 search results - page 191 / 224
» time 1999
Sort
View
78
Voted
CN
1999
69views more  CN 1999»
15 years 6 days ago
Transport of video over partial order connections
A Partial Order and partial reliable Connection (POC) is an end-to-end transport connection authorized to deliver objects in an order that can differ from the transmitted one. Such...
Luis Rojas-Cardenas, Emmanuel Chaput, Laurent Dair...
128
Voted
DAM
1999
128views more  DAM 1999»
15 years 6 days ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
MST
2002
169views more  MST 2002»
15 years 6 days ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
117
Voted
ISCA
1999
IEEE
95views Hardware» more  ISCA 1999»
15 years 4 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
HPCA
1999
IEEE
15 years 4 months ago
WildFire: A Scalable Path for SMPs
Researchers have searched for scalable alternatives to the symmetric multiprocessor (SMP) architecture since it was first introduced in 1982. This paper introduces an alternative ...
Erik Hagersten, Michael Koster