Add to ORKGShort version of the technical report available at http://www.eecs.berkeley.edu/Pubs/TechRpts/2015/EECS-2015-163.pdf as Technical Report No. UCB/EECS-2015-163International audienc
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We present lower bounds on the amount of communication that matrix multiplication algorithms must pe...
We study Reader-Writer Exclusion, a well-known variant of the Mutual Exclusion problem where process...
Short version of the technical report available at http://www.eecs.berkeley.edu/Pubs/TechRpts/2015/E...
The future of main memory appears to lie in the direction of new non-volatile memory technologies th...
Dense linear algebra computations are essential to nearly every problem in scientific computing and ...
In this paper we propose a new approach to the study of the communication requirements of distribute...
This is a post-peer-review, pre-copyedit version. The final authenticated version is available onlin...
In several emerging technologies for computer memory (main memory), the cost of reading is significa...
AbstractWe study the effect of limited communication throughput on parallel computation in a setting...
www.dei.unipd.it/~silvest1 Communication is a major factor determining the performance of algorithms...
International audienceResearchers and practitioners have for long worked on improving the computatio...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an...
In this thesis we give a constant Remote-Memory-Reference (on CC systems) reader-writer exclusion al...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We present lower bounds on the amount of communication that matrix multiplication algorithms must pe...
We study Reader-Writer Exclusion, a well-known variant of the Mutual Exclusion problem where process...
Short version of the technical report available at http://www.eecs.berkeley.edu/Pubs/TechRpts/2015/E...
The future of main memory appears to lie in the direction of new non-volatile memory technologies th...
Dense linear algebra computations are essential to nearly every problem in scientific computing and ...
In this paper we propose a new approach to the study of the communication requirements of distribute...
This is a post-peer-review, pre-copyedit version. The final authenticated version is available onlin...
In several emerging technologies for computer memory (main memory), the cost of reading is significa...
AbstractWe study the effect of limited communication throughput on parallel computation in a setting...
www.dei.unipd.it/~silvest1 Communication is a major factor determining the performance of algorithms...
International audienceResearchers and practitioners have for long worked on improving the computatio...
Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and...
This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an...
In this thesis we give a constant Remote-Memory-Reference (on CC systems) reader-writer exclusion al...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
We present lower bounds on the amount of communication that matrix multiplication algorithms must pe...
We study Reader-Writer Exclusion, a well-known variant of the Mutual Exclusion problem where process...