Sciweavers

935 search results - page 92 / 187
» DataExchange: High Performance Communications in Distributed...
Sort
View
PPOPP
2009
ACM
16 years 13 days ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SIGMETRICS
2005
ACM
127views Hardware» more  SIGMETRICS 2005»
15 years 5 months ago
A data streaming algorithm for estimating subpopulation flow size distribution
Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands,...
Abhishek Kumar, Minho Sung, Jun Xu, Ellen W. Zegur...
JSAC
2011
171views more  JSAC 2011»
14 years 6 months ago
CodeOn: Cooperative Popular Content Distribution for Vehicular Networks using Symbol Level Network Coding
—Driven by both safety concerns and commercial interests, one of the key services offered by vehicular networks is popular content distribution (PCD). The fundamental challenges ...
Ming Li, Zhenyu Yang, Wenjing Lou
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 1 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
INFORMS
1998
142views more  INFORMS 1998»
14 years 11 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol