A distributed packed storage for large dense parallel in-core calculations
In this paper we propose a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix while maintaining most of the efficiency compared with a full storage for a wide range of operations. This work has been m...
Uložené v:
| Vydané v: | Concurrency and computation Ročník 19; číslo 4; s. 483 - 502 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Chichester, UK
John Wiley & Sons, Ltd
25.03.2007
Wiley |
| Predmet: | |
| ISSN: | 1532-0626, 1532-0634 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper we propose a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix while maintaining most of the efficiency compared with a full storage for a wide range of operations. This work has been motivated by the fact that, in contrast to sequential linear algebra libraries (e.g. LAPACK), there is no routine or format that handles packed matrices in the currently available parallel distributed libraries. The proposed algorithms exclusively use the existing ScaLAPACK computational kernels, which proves the generality of the approach, provides easy portability of the code and provides efficient re‐use of existing software. The performance results obtained for the Cholesky factorization show that our packed format performs as good as or better than the ScaLAPACK full storage algorithm for a small number of processors. For a larger number of processors, the ScaLAPACK full storage routine performs slightly better until each processor runs out of memory. Copyright © 2006 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | In this paper we propose a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix while maintaining most of the efficiency compared with a full storage for a wide range of operations. This work has been motivated by the fact that, in contrast to sequential linear algebra libraries (e.g. LAPACK), there is no routine or format that handles packed matrices in the currently available parallel distributed libraries. The proposed algorithms exclusively use the existing ScaLAPACK computational kernels, which proves the generality of the approach, provides easy portability of the code and provides efficient re‐use of existing software. The performance results obtained for the Cholesky factorization show that our packed format performs as good as or better than the ScaLAPACK full storage algorithm for a small number of processors. For a larger number of processors, the ScaLAPACK full storage routine performs slightly better until each processor runs out of memory. Copyright © 2006 John Wiley & Sons, Ltd. |
| Author | Baboulin, Marc Gratton, Serge Langou, Julien Giraud, Luc |
| Author_xml | – sequence: 1 givenname: Marc surname: Baboulin fullname: Baboulin, Marc email: baboulin@cerfacs.fr organization: CERFACS, 42 avenue Gaspard Coriolis, 31057 Toulouse Cedex, France – sequence: 2 givenname: Luc surname: Giraud fullname: Giraud, Luc organization: ENSEEIHT, 2 rue Camichel, 31071 Toulouse Cedex, France – sequence: 3 givenname: Serge surname: Gratton fullname: Gratton, Serge organization: CERFACS, 42 avenue Gaspard Coriolis, 31057 Toulouse Cedex, France – sequence: 4 givenname: Julien surname: Langou fullname: Langou, Julien organization: University of Tennessee, 1122 Volunteer Boulevard, Knoxville, TN 37996-3450, U.S.A |
| BackLink | https://hal.science/hal-03707948$$DView record in HAL |
| BookMark | eNp1kMFOwzAQRC1UJNqCxCfkCIeUdWzHybFEpaWqoAcQR8txNxBqkspOgf49rooqceA0o923o9UMSK9pGyTkksKIAiQ3ZoMjSml-QvpUsCSGlPHe0SfpGRl4_w5AKTDaJ_NxtKp95-py2-Eq2mizDuK71ulXjKrWRVa74FbYeAxrp61FG9VNbFqHkdHWbK3u6rbx5-S00tbjxa8OyfPd5KmYxYvH6X0xXsQmybM8pqAFVAKzrCwlSKNByExiwite8kyKqtQoBOe5SEwVPpa6xAoogxR5BqVmQ3J9yH3TVm1c_aHdTrW6VrPxQu1nwEJuzrNPGtirA2tc673D6nhAQe37UqEvte8roPEB_aot7v7lVLGc_OVDffh95LVbq1QyKdTLw1Tdpg_pcl5wNWU_MmF7ag |
| Cites_doi | 10.1137/1.9780898719642 10.1145/1067967.1067969 10.1155/1996/483083 10.2172/754353 10.1137/0915074 10.1137/1.9780898719604 10.1145/77626.79170 10.1016/0167-8191(90)90156-4 10.1145/1055531.1055534 10.1007/11558958_2 10.1177/1094342005056134 10.1145/383738.383741 |
| ContentType | Journal Article |
| Copyright | Copyright © 2006 John Wiley & Sons, Ltd. Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Copyright © 2006 John Wiley & Sons, Ltd. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | BSCLL AAYXX CITATION 1XC |
| DOI | 10.1002/cpe.1119 |
| DatabaseName | Istex CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Mathematics |
| EISSN | 1532-0634 |
| EndPage | 502 |
| ExternalDocumentID | oai:HAL:hal-03707948v1 10_1002_cpe_1119 CPE1119 ark_67375_WNG_B6N6PJC4_G |
| Genre | article |
| GroupedDBID | .3N .DC .GA .Y3 05W 0R~ 10A 1L6 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEIGN AEIMD AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGQPQ AGYGG AHBTC AITYG AIURR AJXKR ALMA_UNASSIGNED_HOLDINGS ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BSCLL BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS EJD F00 F01 F04 F5P FEDTE G-S G.N GNP GODZA HGLYW HHY HVGLF HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAYXX CITATION O8X 1XC ALUQN |
| ID | FETCH-LOGICAL-c2989-10a50f5e88bb707ca05787e24f4b4875fbae5544952cf0627abef01306e480ba3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000245153000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1532-0626 |
| IngestDate | Tue Oct 14 20:36:58 EDT 2025 Sat Nov 29 01:41:09 EST 2025 Tue Nov 11 03:08:43 EST 2025 Tue Nov 11 03:31:47 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2989-10a50f5e88bb707ca05787e24f4b4875fbae5544952cf0627abef01306e480ba3 |
| Notes | istex:35756EDEBFF07B63523910749ADFEE30C818C964 ArticleID:CPE1119 ark:/67375/WNG-B6N6PJC4-G |
| ORCID | 0000-0002-5021-2357 |
| PageCount | 20 |
| ParticipantIDs | hal_primary_oai_HAL_hal_03707948v1 crossref_primary_10_1002_cpe_1119 wiley_primary_10_1002_cpe_1119_CPE1119 istex_primary_ark_67375_WNG_B6N6PJC4_G |
| PublicationCentury | 2000 |
| PublicationDate | 2007-03-25 25 March 2007 |
| PublicationDateYYYYMMDD | 2007-03-25 |
| PublicationDate_xml | – month: 03 year: 2007 text: 2007-03-25 day: 25 |
| PublicationDecade | 2000 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Concurrency and computation |
| PublicationTitleAlternate | Concurrency Computat.: Pract. Exper |
| PublicationYear | 2007 |
| Publisher | John Wiley & Sons, Ltd Wiley |
| Publisher_xml | – name: John Wiley & Sons, Ltd – name: Wiley |
| References | Dongarra J, Du Croz J, Duff I, Hammarling S. A set of Level 3 Basic Linear Algebra Subprograms. ACM Transactions on Mathematical Software 1990; 16:1-17. van de Geijn R. Using PLAPACK. MIT Press: Cambridge, MA, 1997. Andersen B, Gustavson F, Waśniewski J. A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Transactions on Mathematical Software 2001; 27(2):214-244. Andersen B, Gunnels J, Gustavson F, Reid J, Waśniewski J. A fully portable high performance minimal storage hybrid Cholesky algorithm. ACM Transactions on Mathematical Software 2005; 31(2):201-207. Choi J, Dongarra J, Ostrouchov L, Petitet A, Walker D, Whaley R. The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Scientific Programming 1996; 5:173-184. Baboulin M, Giraud L, Gratton S. A parallel distributed solver for large dense symmetric systems: Applications to geodesy and electromagnetism problems. International Journal of High Performance Computing Applications 2005; 19(4):353-363. Gunter B, van de Geijn R. Parallel out-of-core computation and updating of the QR factorization. ACM Transactions on Mathematical Software 2005; 31(1):60-78. Hendrickson BA, Womble DE. The torus-wrap mapping for dense matrix calculations on massively parallel computers. SIAM Journal of Scientific Computing 1994; 15(5):1201-1226. Anderson E et al. LAPACK User's Guide (3rd edn). SIAM: Philadelphia, PA, 1999. Stewart GW. Communication and matrix computations on large message passing systems. Parallel Computing 1990; 16:27-40. Blackford L et al. ScaLAPACK User's Guide. SIAM: Philadelphia, PA, 1997. 2005; 19 2001 1990; 16 1998 1997 2005; 31 1996 1995 2006 2005 1994; 15 2001; 27 1996; 5 1999 Dongarra J (e_1_2_1_9_2) 1990; 16 Joffrain T (e_1_2_1_16_2) 2006 Gustavson F (e_1_2_1_15_2) 1996 e_1_2_1_6_2 e_1_2_1_7_2 e_1_2_1_4_2 e_1_2_1_5_2 e_1_2_1_2_2 e_1_2_1_11_2 e_1_2_1_3_2 e_1_2_1_12_2 e_1_2_1_10_2 e_1_2_1_21_2 van de Geijn R (e_1_2_1_20_2) 1997 e_1_2_1_14_2 e_1_2_1_19_2 e_1_2_1_8_2 e_1_2_1_17_2 Gunter B (e_1_2_1_13_2) 2001 e_1_2_1_18_2 |
| References_xml | – reference: Anderson E et al. LAPACK User's Guide (3rd edn). SIAM: Philadelphia, PA, 1999. – reference: Dongarra J, Du Croz J, Duff I, Hammarling S. A set of Level 3 Basic Linear Algebra Subprograms. ACM Transactions on Mathematical Software 1990; 16:1-17. – reference: Hendrickson BA, Womble DE. The torus-wrap mapping for dense matrix calculations on massively parallel computers. SIAM Journal of Scientific Computing 1994; 15(5):1201-1226. – reference: Gunter B, van de Geijn R. Parallel out-of-core computation and updating of the QR factorization. ACM Transactions on Mathematical Software 2005; 31(1):60-78. – reference: Andersen B, Gustavson F, Waśniewski J. A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Transactions on Mathematical Software 2001; 27(2):214-244. – reference: Stewart GW. Communication and matrix computations on large message passing systems. Parallel Computing 1990; 16:27-40. – reference: Andersen B, Gunnels J, Gustavson F, Reid J, Waśniewski J. A fully portable high performance minimal storage hybrid Cholesky algorithm. ACM Transactions on Mathematical Software 2005; 31(2):201-207. – reference: Baboulin M, Giraud L, Gratton S. A parallel distributed solver for large dense symmetric systems: Applications to geodesy and electromagnetism problems. International Journal of High Performance Computing Applications 2005; 19(4):353-363. – reference: Choi J, Dongarra J, Ostrouchov L, Petitet A, Walker D, Whaley R. The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines. Scientific Programming 1996; 5:173-184. – reference: van de Geijn R. Using PLAPACK. MIT Press: Cambridge, MA, 1997. – reference: Blackford L et al. ScaLAPACK User's Guide. SIAM: Philadelphia, PA, 1997. – start-page: 11 year: 2006 end-page: 20 – volume: 31 start-page: 201 issue: 2 year: 2005 end-page: 207 article-title: A fully portable high performance minimal storage hybrid Cholesky algorithm publication-title: ACM Transactions on Mathematical Software – volume: 27 start-page: 214 issue: 2 year: 2001 end-page: 244 article-title: A recursive formulation of Cholesky factorization of a matrix in packed storage publication-title: ACM Transactions on Mathematical Software – volume: 15 start-page: 1201 issue: 5 year: 1994 end-page: 1226 article-title: The torus‐wrap mapping for dense matrix calculations on massively parallel computers publication-title: SIAM Journal of Scientific Computing – year: 2005 – volume: 16 start-page: 27 year: 1990 end-page: 40 article-title: Communication and matrix computations on large message passing systems publication-title: Parallel Computing – year: 2001 – year: 1997 – year: 1996 – year: 1995 – volume: 31 start-page: 60 issue: 1 year: 2005 end-page: 78 article-title: Parallel out‐of‐core computation and updating of the QR factorization publication-title: ACM Transactions on Mathematical Software – volume: 16 start-page: 1 year: 1990 end-page: 17 article-title: A set of Level 3 Basic Linear Algebra Subprograms publication-title: ACM Transactions on Mathematical Software – start-page: 414 year: 2006 end-page: 423 – volume: 5 start-page: 173 year: 1996 end-page: 184 article-title: The design and implementation of the ScaLAPACK LU, QR, and Cholesky factorization routines publication-title: Scientific Programming – volume: 19 start-page: 353 issue: 4 year: 2005 end-page: 363 article-title: A parallel distributed solver for large dense symmetric systems: Applications to geodesy and electromagnetism problems publication-title: International Journal of High Performance Computing Applications – year: 1998 – year: 1999 – ident: e_1_2_1_11_2 – ident: e_1_2_1_2_2 doi: 10.1137/1.9780898719642 – ident: e_1_2_1_17_2 – ident: e_1_2_1_10_2 doi: 10.1145/1067967.1067969 – ident: e_1_2_1_21_2 doi: 10.1155/1996/483083 – volume-title: Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS) year: 2001 ident: e_1_2_1_13_2 – ident: e_1_2_1_19_2 doi: 10.2172/754353 – ident: e_1_2_1_7_2 doi: 10.1137/0915074 – ident: e_1_2_1_3_2 doi: 10.1137/1.9780898719604 – volume: 16 start-page: 1 year: 1990 ident: e_1_2_1_9_2 article-title: A set of Level 3 Basic Linear Algebra Subprograms publication-title: ACM Transactions on Mathematical Software doi: 10.1145/77626.79170 – ident: e_1_2_1_8_2 doi: 10.1016/0167-8191(90)90156-4 – ident: e_1_2_1_14_2 doi: 10.1145/1055531.1055534 – ident: e_1_2_1_18_2 doi: 10.1007/11558958_2 – volume-title: Using PLAPACK year: 1997 ident: e_1_2_1_20_2 – ident: e_1_2_1_6_2 – volume-title: Proceedings of the 4th Workshop on I/O in Parallel and Distributed Systems (IOPADS'96) year: 1996 ident: e_1_2_1_15_2 – start-page: 414 volume-title: Proceedings of State‐of‐the‐art in Scientific Computing: 7th International Workshop on Applied Parallel Computing (PARA 2004) year: 2006 ident: e_1_2_1_16_2 – ident: e_1_2_1_5_2 doi: 10.1177/1094342005056134 – ident: e_1_2_1_4_2 – ident: e_1_2_1_12_2 doi: 10.1145/383738.383741 |
| SSID | ssj0011031 |
| Score | 1.7280208 |
| Snippet | In this paper we propose a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only... |
| SourceID | hal crossref wiley istex |
| SourceType | Open Access Repository Index Database Publisher |
| StartPage | 483 |
| SubjectTerms | Cholesky factorization dense linear algebra Mathematics packed storage format parallel distributed algorithms QR factorization ScaLAPACK scientific computing |
| Title | A distributed packed storage for large dense parallel in-core calculations |
| URI | https://api.istex.fr/ark:/67375/WNG-B6N6PJC4-G/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.1119 https://hal.science/hal-03707948 |
| Volume | 19 |
| WOSCitedRecordID | wos000245153000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3NT8IwFMAbAQ9exM-IX6nGeFsoXQfjiMhHzEKIkchtaUsbCWQSQOLRP8G_0b_E97Yxw8HExF2abF22vPa177Wvv0fIDcxAQsPlWD2yjvBwk9BWpMM52MYu8lBkTNcPar2ePxzW-2lUJZ6FSfgQ2YIbakY8XqOCS7Uo_0BD9cygvtdzpIBnqsDxKtw_tgdBtoeACQwSWip3GNjta_Qs4-X1uxuTUe4FQyELKN33TVM1nmvaxf_85R7ZTS1M2ki6xD7ZMtEBKa6zN9BUmQ9J0KAjpOZiwiszouA7T6DAYEkYYijYsnSKUeIUBqaFoYgIn07NlI6jr49PZF9SaF2dJv9aHJFBu_XU7DppbgVHI3MdRl_pMesZ31eqxmpaMlRdw4UVCn0Yq6QBSwPcJ64tooylMhZ3OatG-ExJ95jko9fInBAqtac5s1oJ1xeSub5Fu2PkVhSy8zxbIldrIYezBKERJrBkHoJ40Aepl8g1SD97jMzrbiMI8R5zEeIn_FWlRG7jxsmqyfkE49JqXvjc64R31V61_9AUYQcqxm3y6-fCZr-F5elfK56RnWRR13W4d07yy_mbuSDberUcL-aXac_7Brrf2q0 |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3dS8MwEMAP3QR98Vucn1HEt2KWpmuHT3NuTq1liKJvIc0SHBtzbCo--if4N_qXmOvHZA-CYF8KbUrLJXe5S66_AziyMxBX9nCM6hiHe7hJaMrSYcz6xi7yUGRC1w_9KAoeH6vtGTjN_4VJ-RCTBTfUjMReo4LjgvTJDzVUDTUqfHUWirzi-kEBiue3zftwsomAFQxSXCpzqHXcc_YsZSf5s1Oz0ewT5kIWUbzv075qMtk0l_71mcuwmPmYpJYOihWY0YNVWMrrN5BMndcgrJEOcnOx5JXuEBs99-wJ0yWtkSHWmyV9zBMn1jSNNUFIeL-v-6Q7-Pr4RPolsf2rsvJf43W4bzbu6i0nq67gKKSuW_srPWo8HQRx7FNfSYrKqxk3PMYoxsRSW1_DBlBMGYQZy1gb3OesaB7QWLobUBg8D_QmEKk8xahRMXcDLqkbGPQ8Om45RnqeZ0pwkEtZDFOIhkhxyUxY8WAUUi3BoRX_5DZSr1u1UOA16iLGjwdv5RIcJ70zaSZHPcxM8z3xEF2Is0pUaV_VubiwDZNO-fV1ot5u4Hnrrw33Yb51dxOK8DK63oaFdInXdZi3A4WX0avehTn19tIdj_ayYfgN20benQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3dS8MwEMCPuYn44vzE-RlFfCtmabJ1-DSn86uUIYq-hTRNUBxzbCo--if4N_qXmOvHxAdBsC-FNqXlkrvcJdffAey5GYhrd3hWJ9bjAjcJbV15jDnf2Eceikrp-mEzioK7u1avBIfFvzAZH2Ky4IaakdprVHAzTOzBNzVUDw0qfGsKKly0BC9D5fiqexNONhGwgkGGS2UedY57wZ6l7KB49sdsNHWPuZAVFO_bT181nWy61X995jzM5T4maWeDYgFKZrAI1aJ-A8nVeQnCNkmQm4slr0xCXPT86E6YLumMDHHeLOljnjhxpmlsCELC-33TJw-Dz_cPpF8S1786L_81Xoab7sl158zLqyt4Gqnrzv4qQa0wQRDHTdrUiqLyGsYtjzGKsbEyztdwARTTFmHGKjYW9zkbhgc0Vv4KlAdPA7MKRGmhGbU65n7AFfUDi55H4tdjpOcJW4OdQspymEE0ZIZLZtKJB6OQVg12nfgnt5F6fdYOJV6jPmL8ePBar8F-2juTZmr0iJlpTSFvo1N51IgavYsOl6euYdopv75OdnoneF77a8NtmOkdd2V4Hl2uw2y2wut7TGxA-Xn0YjZhWr8-P4xHW_ko_AKXFt4Y |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+distributed+packed+storage+for+large+dense+parallel+in-core+calculations&rft.jtitle=Concurrency+and+computation&rft.au=Baboulin%2C+Marc&rft.au=Giraud%2C+Luc&rft.au=Gratton%2C+Serge&rft.au=Langou%2C+Julien&rft.date=2007-03-25&rft.pub=John+Wiley+%26+Sons%2C+Ltd&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=19&rft.issue=4&rft.spage=483&rft.epage=502&rft_id=info:doi/10.1002%2Fcpe.1119&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_B6N6PJC4_G |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon |