Sat, 26 Jul 2008 16:58:02 BST CiteULike: AbnerCYH parallel http://www.citeulike.org/user/AbnerCYH/tag/parallel CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/AbnerCYH/article/2627756 <i>Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on (2003), pp. 300-307.</i><br /><br />This paper addresses the problem of parallel transposition of large out-of-core arrays. Although algorithms for out-of-core matrix transposition have been widely studied, previously proposed algorithms have sought to minimize the number of I/O operations and the in-memory permutation time. We propose an algorithm that directly targets the improvement of overall transposition time. The I/O characteristics of the system are used to determine the read, write and communication block sizes such that the total execution time is minimized. We also provide a solution to the array redistribution problem for arrays on disk. The solution to the sequential transposition problem and the parallel array redistribution problem are then combined to obtain an algorithm for the parallel out-of-core transposition problem. Efficient parallel out-of-core matrix transposition S Krisnamoorthy G Baumgartner D Cociorva Chi-Chung Lam P Sadyappan doi:10.1109/CLUSTR.2003.1253328 Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on (2003), pp. 300-307. 2008-04-03T19:35:51-00:00 2003 Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on 300 307 algorithms data_structure parallel http://www.citeulike.org/user/AbnerCYH/article/2625760 <i>(2002), pp. 713-722.</i> Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms Seth Pettie Vijaya Ramachandran (2002), pp. 713-722. 2008-04-03T11:01:40-00:00 2002 713 722 Society for Industrial and Applied Mathematics algorithms graph parallel http://www.citeulike.org/user/AbnerCYH/article/2625759 <i>SIAM J. Comput., Vol. 31, No. 6. (2002), pp. 1879-1895.</i> A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest Seth Pettie Vijaya Ramachandran doi:10.1137/S0097539700371065 SIAM J. Comput., Vol. 31, No. 6. (2002), pp. 1879-1895. 2008-04-03T11:01:35-00:00 2002 SIAM J. Comput. 0097-5397 31 6 1879 1895 Society for Industrial and Applied Mathematics algorithms graph parallel stochastic http://www.citeulike.org/user/AbnerCYH/article/2625042 <i>SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136.</i> Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems Thomas Cormen Thomas Sundquist Leonard Wisniewski SIAM Journal on Computing, Vol. 28, No. 1. (1998), pp. 105-136. 2008-04-03T03:38:08-00:00 1998 SIAM Journal on Computing 28 1 105 136 SIAM algorithms complexity data_structure parallel http://www.citeulike.org/user/AbnerCYH/article/2624181 <i>(1996), pp. 128-139.</i> Structured permuting in place on parallel disk systems Leonard Wisniewski doi:10.1145/236017.236047 (1996), pp. 128-139. 2008-04-02T18:18:07-00:00 1996 128 139 ACM algorithms parallel sys_performance http://www.citeulike.org/user/AbnerCYH/article/2588835 <i>SIAM Journal on Computing, Vol. 18, No. 2. (1989), pp. 419-427.</i> A New Parallel Algorithm for the Maximal Independent Set Problem Mark Goldberg Thomas Spencer SIAM Journal on Computing, Vol. 18, No. 2. (1989), pp. 419-427. 2008-03-26T09:21:01-00:00 1989 SIAM Journal on Computing 18 2 419 427 SIAM algorithms graph parallel http://www.citeulike.org/user/AbnerCYH/article/2588834 <i>SIAM Journal on Discrete Mathematics, Vol. 6, No. 3. (1993), pp. 443-459.</i> An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size Mark Goldberg Thomas Spencer SIAM Journal on Discrete Mathematics, Vol. 6, No. 3. (1993), pp. 443-459. 2008-03-26T09:20:56-00:00 1993 SIAM Journal on Discrete Mathematics 6 3 443 459 SIAM algorithms graph parallel http://www.citeulike.org/user/AbnerCYH/article/2242861 <i>ACM Comput. Surv., Vol. 16, No. 3. (September 1984), pp. 319-348.</i> Parallel graph algorithms Michael Quinn Narsingh Deo doi:10.1145/2514.2515 ACM Comput. Surv., Vol. 16, No. 3. (September 1984), pp. 319-348. 2008-01-17T04:58:39-00:00 1984 ACM Comput. Surv. 0360-0300 16 3 319 348 ACM algorithms parallel