Bitonic sorter

Results: 28



#Item
1Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy

Improved Parallel Integer Sorting without Concurrent Writing Susanne Albersyz Torben Hagerupy

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:42
2Optimized composition of performance-aware parallel components? ?? Christoph W. Kessler1 and Welf L¨owe2 1  IDA, Link¨oping University, 58183 Link¨oping, Sweden.

Optimized composition of performance-aware parallel components? ?? Christoph W. Kessler1 and Welf L¨owe2 1 IDA, Link¨oping University, 58183 Link¨oping, Sweden.

Add to Reading List

Source URL: welf.se

Language: English - Date: 2013-04-23 05:54:26
3

PDF Document

Add to Reading List

Source URL: lara.epfl.ch

Language: English - Date: 2013-09-21 11:10:41
4Distributed Computing FS 2013 Prof. R. Wattenhofer Stephan Holzer

Distributed Computing FS 2013 Prof. R. Wattenhofer Stephan Holzer

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:47
5Chapter 4  Distributed Sorting “Indeed, I believe that virtually every important aspect of programming arises somewhere in the context of sorting [and searching]!” – Donald E. Knuth, The Art of Computer Programming

Chapter 4 Distributed Sorting “Indeed, I believe that virtually every important aspect of programming arises somewhere in the context of sorting [and searching]!” – Donald E. Knuth, The Art of Computer Programming

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
6How to Submit Your Final Camera-Ready Paper for the Genetic Programming 1998 Conference (GP-98)

How to Submit Your Final Camera-Ready Paper for the Genetic Programming 1998 Conference (GP-98)

Add to Reading List

Source URL: www.genetic-programming.org

Language: English - Date: 2006-11-17 21:29:15
732  CHAPTER 4. DISTRIBUTED SORTING Algorithm 16 Odd/Even Sort 1: Given an array of n nodes (v1 , . . . , vn ), each storing a value (not sorted).

32 CHAPTER 4. DISTRIBUTED SORTING Algorithm 16 Odd/Even Sort 1: Given an array of n nodes (v1 , . . . , vn ), each storing a value (not sorted).

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
8

PDF Document

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:47
9On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University

On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University

Add to Reading List

Source URL: larc.unt.edu

Language: English - Date: 2011-05-12 16:09:32
10Preliminary Thoughts on Ultracomputer Programming Style by J.T. Schwartz Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor

Preliminary Thoughts on Ultracomputer Programming Style by J.T. Schwartz Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor

Add to Reading List

Source URL: www.multimedialibrary.com

Language: English - Date: 2014-03-05 11:07:09