-
4
-
-
70350482696
-
MPI on a million processors
-
P. Balaji, D. Buntinas, D. Goodell, W. Gropp, S. Kumar, E. L. Lusk, R. Thakur, and J. L. Träff. MPI on a million processors. In PVM/MPI, pages 20-30, 2009.
-
(2009)
PVM/MPI
, pp. 20-30
-
-
Balaji, P.1
Buntinas, D.2
Goodell, D.3
Gropp, W.4
Kumar, S.5
Lusk, E.L.6
Thakur, R.7
Träff, J.L.8
-
5
-
-
84880226495
-
Compressed representations of permutations, and applications
-
S. Albers and J.-Y. Marion, editors, Dagstuhl, Germany
-
J. Barbay and G. Navarro. Compressed representations of permutations, and applications. In S. Albers and J.-Y. Marion, editors, 26th Intl. Symp. on Theoretical Aspects of Computer Science (STACS), pages 111-122, Dagstuhl, Germany, 2009.
-
(2009)
26th Intl. Symp. on Theoretical Aspects of Computer Science (STACS)
, pp. 111-122
-
-
Barbay, J.1
Navarro, G.2
-
6
-
-
47149096899
-
Understanding the high-performance-computing community: A software engineer's perspective
-
V. R. Basili, J. C. Carver, D. Cruzes, L. M. Hochstein, J. K. Hollingsworth, F. Shull, and M. V. Zelkowitz. Understanding the high-performance-computing community: A software engineer's perspective. IEEE Softw., 25(4):29-36, 2008.
-
(2008)
IEEE Softw.
, vol.25
, Issue.4
, pp. 29-36
-
-
Basili, V.R.1
Carver, J.C.2
Cruzes, D.3
Hochstein, L.M.4
Hollingsworth, J.K.5
Shull, F.6
Zelkowitz, M.V.7
-
7
-
-
0022769976
-
Graph-based algorithms for boolean function manipulation
-
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35:677-691, 1986.
-
(1986)
IEEE Transactions on Computers
, vol.35
, pp. 677-691
-
-
Bryant, R.E.1
-
8
-
-
33751106433
-
Design and evaluation of Nemesis, a scalable, low-latency, message-passing communication subsystem
-
Washington, DC, USA. IEEE Computer Society
-
D. Buntinas, W. Gropp, and G. Mercier. Design and evaluation of Nemesis, a scalable, low-latency, message-passing communication subsystem. In Proc. of the Sixth IEEE Intl. Symp. on Cluster Computing and the Grid (CCGRID), pages 521-530, Washington, DC, USA, 2006. IEEE Computer Society.
-
(2006)
Proc. of the Sixth IEEE Intl. Symp. on Cluster Computing and the Grid (CCGRID)
, pp. 521-530
-
-
Buntinas, D.1
Gropp, W.2
Mercier, G.3
-
10
-
-
47749128884
-
Evaluating sparse data storage techniques for mpi groups and communicators
-
Berlin, Heidelberg. Springer-Verlag
-
M. Chaarawi and E. Gabriel. Evaluating sparse data storage techniques for mpi groups and communicators. In ICCS '08: Proceedings of the 8th international conference on Computational Science, Part I, pages 297-306, Berlin, Heidelberg, 2008. Springer-Verlag.
-
(2008)
ICCS '08: Proceedings of the 8th International Conference on Computational Science, Part i
, pp. 297-306
-
-
Chaarawi, M.1
Gabriel, E.2
-
11
-
-
0035364733
-
Generalized communicators in the message passing interface
-
E. D. Demaine, I. Foster, C. Kesselman, and M. Snir. Generalized communicators in the message passing interface. IEEE Trans. Parallel Distrib. Syst., 12(6):610-616, 2001.
-
(2001)
IEEE Trans. Parallel Distrib. Syst.
, vol.12
, Issue.6
, pp. 610-616
-
-
Demaine, E.D.1
Foster, I.2
Kesselman, C.3
Snir, M.4
-
12
-
-
0003417929
-
-
MIT Press, Cambridge, MA, USA
-
W. Gropp, E. Lusk, and A. Skjellum. Using MPI (2nd ed.): Portable parallel programming with the message-passing interface. MIT Press, Cambridge, MA, USA, 1999.
-
(1999)
Using MPI (2nd Ed.): Portable Parallel Programming with the Message-passing Interface
-
-
Gropp, W.1
Lusk, E.2
Skjellum, A.3
-
13
-
-
33750279670
-
Issues in developing a thread-safe MPI implementation
-
W. D. Gropp and R. Thakur. Issues in developing a thread-safe MPI implementation. In PVM/MPI, pages 12-21, 2006.
-
(2006)
PVM/MPI
, pp. 12-21
-
-
Gropp, W.D.1
Thakur, R.2
-
14
-
-
65949095627
-
Breaking a time-and-space barrier in constructing full-text indices
-
W.-K. Hon, K. Sadakane, and W.-K. Sung. Breaking a time-and-space barrier in constructing full-text indices. SIAM J. Comput., 38(6):2162-2178, 2009.
-
(2009)
SIAM J. Comput.
, vol.38
, Issue.6
, pp. 2162-2178
-
-
Hon, W.-K.1
Sadakane, K.2
Sung, W.-K.3
-
15
-
-
0000978261
-
Optimal computer search trees and variable-length alphabetical codes
-
T. C. Hu and A. C. Tucker. Optimal computer search trees and variable-length alphabetical codes. SIAM Journal on Applied Mathematics, 21(4):514-532, 1971.
-
(1971)
SIAM Journal on Applied Mathematics
, vol.21
, Issue.4
, pp. 514-532
-
-
Hu, T.C.1
Tucker, A.C.2
-
17
-
-
70350676784
-
A linear-time burrows-wheeler transform using induced sorting
-
D. Okanohara and K. Sadakane. A linear-time burrows-wheeler transform using induced sorting. In SPIRE, pages 90-101, 2009.
-
(2009)
SPIRE
, pp. 90-101
-
-
Okanohara, D.1
Sadakane, K.2
-
19
-
-
65249167570
-
RLH: Bitmap compression technique based on run-length and huffman encoding
-
M. Stabno and R. Wrembel. RLH: Bitmap compression technique based on run-length and huffman encoding. Info. Sys., 34(4-5):400-414, 2009.
-
(2009)
Info. Sys.
, vol.34
, Issue.4-5
, pp. 400-414
-
-
Stabno, M.1
Wrembel, R.2
-
20
-
-
77954057588
-
-
Available from
-
E. Toernig. Coroutine library. Available from http://www.goron.de/ ~froese/coro/coro.html.
-
Coroutine Library
-
-
Toernig, E.1
-
22
-
-
21644460050
-
Capriccio: Scalable threads for internet services
-
New York, NY, USA. ACM
-
R. von Behren, J. Condit, F. Zhou, G. C. Necula, and E. Brewer. Capriccio: scalable threads for internet services. In SOSP '19, pages 268-281, New York, NY, USA, 2003. ACM.
-
(2003)
SOSP '19
, pp. 268-281
-
-
Von Behren, R.1
Condit, J.2
Zhou, F.3
Necula, G.C.4
Brewer, E.5
|