Zobrazeno 1 - 10
of 433
pro vyhledávání: '"Intel Paragon"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 13:1303-1319
Many large-scale applications have significant I/O requirements as well as computational and memory requirements. Unfortunately, the limited number of I/O nodes provided in a typical configuration of the modern message-passing distributed-memory arch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6592fb89e0327a6918622717e70f717
https://doi.org/10.1109/tpds.2002.1158267
https://doi.org/10.1109/tpds.2002.1158267
Publikováno v:
Journal of Parallel and Distributed Computing. 62:193-220
We present the design, implementation, and evaluation of a runtime system based on collective I/O techniques for irregular applications. The design is motivated by the requirements of a large number of science and engineering applications including t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf1b8a1ce06a564b0caf087e7e8a12b5
https://doi.org/10.1006/jpdc.2001.1788
https://doi.org/10.1006/jpdc.2001.1788
Autor:
Xian-He Sun
Publikováno v:
Journal of Parallel and Distributed Computing. 62:173-192
Parallel programming is elusive. The relative performance of different parallel implementations varies with machine architecture, system and problem size. How to compare different implementations over a wide range of machine architectures and problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d9db5ae2b6bd772a842b063046f3500
https://doi.org/10.1006/jpdc.2001.1773
https://doi.org/10.1006/jpdc.2001.1773
Publikováno v:
SIAM Journal on Scientific Computing. 24:284-311
One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR algorithm. Not long ago, this was widely considered to be a hopeless task. Recent efforts have led to significant advances, although the methods proposed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eeca71786c32dff86d9ff0369a56c512
https://doi.org/10.1137/s1064827597325165
https://doi.org/10.1137/s1064827597325165
Publikováno v:
Parallel Computing. 28:83-105
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by making many small, distinct I/O requests, however, the I/O performance degrad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50983dfc6cc20e7cd67969e064d38089
https://doi.org/10.1016/s0167-8191(01)00129-6
https://doi.org/10.1016/s0167-8191(01)00129-6
Autor:
Shahriar M. Akramullah
The information technology of future is likely to be highly dependent on digital video. The key obstacle in realizing this technology, however, lies in the transmission, access and storage requirements of huge amount of data. Compression of a video s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5711f92e74ca43f7ef28cc04c38e2d21
https://doi.org/10.14711/thesis-b482908
https://doi.org/10.14711/thesis-b482908
Autor:
Anthony J. Guttmann, Andrew R. Conway
Publikováno v:
Annals of Combinatorics. 5:319-345
We give an algorithm for the enumeration of self-avoiding walks on the (anisotropic) square lattice. Application of the algorithm on a 1024 processor Intel Paragon supercomputer resulted in a 51 term series. For (isotropic) square lattice self-avoidi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f81208d0a92accd4fc5fbe7267b65c03
https://doi.org/10.1007/pl00013842
https://doi.org/10.1007/pl00013842
Autor:
Carl Tropper, Azzedine Boukerche
Publikováno v:
Parallel Computing. 27:1033-1055
This paper presents an algorithm, which we refer to as SGTNE, to efficiently obtain lookahead information from a cluster of processors in a parallel simulation in order to unblock (logical) processes (LP) in a given processor. The SGTNE algorithm is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4896c102b9f288c3bbc5b3de58dd6068
https://doi.org/10.1016/s0167-8191(01)00070-9
https://doi.org/10.1016/s0167-8191(01)00070-9
Publikováno v:
Parallel Computing. 27:823-846
Video compression plays a central role in a vast number of multimedia applications but its computational requirements overwhelm the capabilities of any present single processor system. In this paper, we explore the use of parallel machines like the I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97a19698abf865d44e6fb3c9b7359a83
https://doi.org/10.1016/s0167-8191(00)00099-5
https://doi.org/10.1016/s0167-8191(00)00099-5
Autor:
Henry M. Tufo, Paul Fischer
Publikováno v:
Journal of Parallel and Distributed Computing. 61:151-177
We have developed a fast direct solver for parallel solution of coarse grid problems, Ax=b, such as arise when domain decomposition or multigrid methods are applied to elliptic partial differential equations in d space dimensions. The approach is bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47f01b3f7bd3ae6e5761b5123543bded
https://doi.org/10.1006/jpdc.2000.1676
https://doi.org/10.1006/jpdc.2000.1676