Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner

First Page		Document Content
Date: 2012-04-16 02:58:44 Mathematics Algorithms Applied mathematics Analysis of algorithms Cache Models of computation Computer science Sorting algorithms Cache-oblivious algorithm Divide and conquer algorithms Matching In-place algorithm		Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner Add to Reading List Source URL: vorner.cz Download Document from Source Website File Size: 941,34 KB Share Document on Facebook

	Lecture 8: The Cache Oblivious Approach www.cs.illinois.edu/~wgropp Designing for Memory Hierarchy DocID: 1rpNE - View Document
	Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Michal Vaner DocID: 1r4Mz - View Document
	Seven at One Stroke: Results from a Cache-Oblivious ∗ Paradigm for Scalable Matrix Algorithms Michael D. Adams David S. Wise DocID: 1r10T - View Document
	IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 3, MARCH 2003 DocID: 1qlb7 - View Document
	Adaptive Matrix Transpose Algorithms for Distributed Multicore Processors John C. Bowman and Malcolm Roberts Abstract An adaptive parallel matrix transpose algorithm optimized for distributed multicore architectures runn DocID: 1q14M - View Document