Results 1 - 10
of
12
Load Balancing and Density Dependent Jump Markov Processes (Extended Abstract)
- In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science
, 1996
"... Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following ..."
Abstract
- Add to MetaCart
Michael Mitzenmacher Department of Computer Science U.C. Berkeley Berkeley, CA 94720 mitzen@cs.berkeley.edu Abstract We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following
Graph partitioning and disturbed diffusion
- Parallel Computing
, 2009
"... The N P-hard graph partitioning problem is an important subtask in load balancing and many other applications. It requires the division of a graph’s vertex set into P equally sized subsets such that some objective function is optimized. State-of-the-art libraries addressing this problem show several ..."
Abstract
-
Cited by 10 (7 self)
- Add to MetaCart
The N P-hard graph partitioning problem is an important subtask in load balancing and many other applications. It requires the division of a graph’s vertex set into P equally sized subsets such that some objective function is optimized. State-of-the-art libraries addressing this problem show
A General Graph Model For Representing Exact Communication Volume in Parallel Sparse Matrix–Vector Multiplication
, 2006
"... In this paper, we present a new graph model of sparse matrix decomposition for parallel sparse matrix–vector multiplication. Our model differs from previous graph-based approaches in two main respects. Firstly, our model is based on edge colouring rather than vertex partitioning. Secondly, our mod ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In this paper, we present a new graph model of sparse matrix decomposition for parallel sparse matrix–vector multiplication. Our model differs from previous graph-based approaches in two main respects. Firstly, our model is based on edge colouring rather than vertex partitioning. Secondly, our
Steady State Analysis of Balanced-Allocation Routing
, 2005
"... We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the "balanced-allocation" principle [Y. Azer, A. Z. Broder, A. ..."
Abstract
- Add to MetaCart
We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the "balanced-allocation" principle [Y. Azer, A. Z. Broder, A
NUMA-aware graph-structured analytics
- In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP
, 2015
"... Graph-structured analytics has been widely adopted in a number of big data applications such as social computation, web-search and recommendation systems. Though much prior research focuses on scaling graph-analytics on distributed environments, the strong desire on performance per core, dollar and ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
load balance and vertex convergence, Polymer is further built with a hierarchical barrier to boost parallelism and locality, an edge-oriented balanced partitioning for skewed graphs, and adaptive data structures according to the proportion of ac-tive vertices. A detailed evaluation on an 80-core
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Secure Geographic Routing in Wireless Sensor Networks
, 2013
"... the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law. The Auth ..."
Abstract
- Add to MetaCart
the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law
Results 1 - 10
of
12