Approximating the buffer allocation problem using epochs

The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages—such applications may deadlock when executed on a system with an insufficient number of messag...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of parallel and distributed computing Ročník 68; číslo 9; s. 1263 - 1282
Hlavní autoři:	Pedersen, Jan Bækgaard, Brodsky, Alex, Sampson, Jeffrey
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 01.09.2008 Elsevier
Témata:	Applied sciences Buffer allocation Complexity Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Message passing systems Parallel and distributed programming Software Message passing systems Parallel and distributed programming Buffer allocation Complexity Deadlock Message passing systems;Buffer allocation;Complexity;Parallel and distributed programming Message passing Optimal solution Buffer memory Distributed system Buffer system Synchronization Distributed computing Polynomial time
ISSN:	0743-7315, 1096-0848
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages—such applications may deadlock when executed on a system with an insufficient number of message buffers. Thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing portable parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [A. Brodsky, J. Pedersen, A. Wagner, On the complexity of buffer allocation in message passing systems, Journal of Parallel and Distributed Computing 65 (2005) 692–713]. We present a new epoch-based polynomial-time approach for approximating a solution to the Buffer Allocation Problem. Our approach partitions application executions into epochs and intersperses barrier synchronizations between them, thus limiting the number of message buffers necessary to ensure deadlock-freedom. This approach produces near optimal solutions for many common cases and can be adapted to guide application modifications that ensure deadlock-freedom when the application is executed on different systems. We describe a prototype implementation, and present an empirical evaluation of this approach. Lastly, we describe a space-time trade-off between the number of available message buffers and the number of barrier synchronizations, and describe how this trade-off can be used to fine-tune application performance.
AbstractList	The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages-such applications may deadlock when executed on a system with an insufficient number of message buffers. Thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing portable parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [A. Brodsky, J. Pedersen, A. Wagner, On the complexity of buffer allocation in message passing systems, Journal of Parallel and Distributed Computing 65 (2005) 692-713]. We present a new epoch-based polynomial-time approach for approximating a solution to the Buffer Allocation Problem. Our approach partitions application executions into epochs and intersperses barrier synchronizations between them, thus limiting the number of message buffers necessary to ensure deadlock-freedom. This approach produces near optimal solutions for many common cases and can be adapted to guide application modifications that ensure deadlock-freedom when the application is executed on different systems. We describe a prototype implementation, and present an empirical evaluation of this approach. Lastly, we describe a space-time trade-off between the number of available message buffers and the number of barrier synchronizations, and describe how this trade-off can be used to fine-tune application performance. The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory (message buffers) to hold all undelivered messages—such applications may deadlock when executed on a system with an insufficient number of message buffers. Thus, determining the minimum number of buffers that an application needs to prevent deadlock is an important task when writing portable parallel applications. Unfortunately, both this problem (called the Buffer Allocation Problem) and the simpler problem of determining whether an application may deadlock for a given number of available message buffers are intractable [A. Brodsky, J. Pedersen, A. Wagner, On the complexity of buffer allocation in message passing systems, Journal of Parallel and Distributed Computing 65 (2005) 692–713]. We present a new epoch-based polynomial-time approach for approximating a solution to the Buffer Allocation Problem. Our approach partitions application executions into epochs and intersperses barrier synchronizations between them, thus limiting the number of message buffers necessary to ensure deadlock-freedom. This approach produces near optimal solutions for many common cases and can be adapted to guide application modifications that ensure deadlock-freedom when the application is executed on different systems. We describe a prototype implementation, and present an empirical evaluation of this approach. Lastly, we describe a space-time trade-off between the number of available message buffers and the number of barrier synchronizations, and describe how this trade-off can be used to fine-tune application performance.
Author	Sampson, Jeffrey Pedersen, Jan Bækgaard Brodsky, Alex
Author_xml	– sequence: 1 givenname: Jan Bækgaard surname: Pedersen fullname: Pedersen, Jan Bækgaard email: matt@cs.unlv.edu organization: School of Computer Science, University of Nevada, Las Vegas, 4505 Maryland Parkway, Las Vegas, NV, 89154-4019, USA – sequence: 2 givenname: Alex surname: Brodsky fullname: Brodsky, Alex email: abrodsky@acs.uwinnipeg.ca organization: Department of Applied Computer Science, University of Winnipeg, 515 Portage Ave., Winnipeg, MB, R3B 2E9, Canada – sequence: 3 givenname: Jeffrey surname: Sampson fullname: Sampson, Jeffrey email: jsampson@cs.unlv.edu organization: School of Computer Science, University of Nevada, Las Vegas, 4505 Maryland Parkway, Las Vegas, NV, 89154-4019, USA
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20615329$$DView record in Pascal Francis
BookMark	eNp9kE1LxDAQhoOs4O7qH_DUi95a89mm4GVZ_IIFL3oOaTpxW7pNTVrRf2_KLh5lDgPD8w4zzwotetcDQtcEZwST_K7N2qE2GcVYZjjPMCZnaElwmadYcrlAS1xwlhaMiAu0CqGNABGFXCK5GQbvvpuDHpv-Ixn3kFSTteAT3XXOxKnrk0hUHRySKcwMDM7swyU6t7oLcHXqa_T--PC2fU53r08v280uNYzQMZVlTXLOjWSFFUSUpgRLQFsuCVSaclGQIhcVw4ZDZWWtKStAyhKTGmsGlK3R7XFvPOJzgjCqQxMMdJ3uwU1BMZ4LJmOt0c0J1MHoznrdmyaowcff_I-iOCeC0TJy9MgZ70LwYP8QgtUsU7VqlqlmmQrnKrqKoftjCOKrXw14FUwDvYG68WBGVbvmv_gvoMx-eQ
Cites_doi	10.1016/j.jpdc.2004.10.009 10.1145/359545.359563 10.1016/0304-3975(86)90046-0 10.1109/18.32150 10.1016/0169-7552(93)90067-E 10.1016/0377-2217(92)90300-X 10.1145/800046.801649 10.1016/j.cor.2006.12.008 10.1109/IPPS.1994.288223 10.1145/215399.215421 10.1109/CDC.1987.272666 10.1145/197917.197940
ContentType	Journal Article
Copyright	2008 Elsevier Inc. 2009 INIST-CNRS
Copyright_xml	– notice: 2008 Elsevier Inc. – notice: 2009 INIST-CNRS
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.jpdc.2008.06.001
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1096-0848
EndPage	1282
ExternalDocumentID	20615329 10_1016_j_jpdc_2008_06_001 S0743731508001068
GroupedDBID	--K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c312t-89d1644c837f5159c9ef1eaf481eba24571765b30c4ebf8da237e88901d0a3e23
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000258732400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Sun Sep 28 09:36:20 EDT 2025 Mon Jul 21 09:17:49 EDT 2025 Sat Nov 29 07:19:35 EST 2025 Fri Feb 23 02:27:55 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	9
Keywords	Message passing systems Parallel and distributed programming Buffer allocation Complexity Deadlock Message passing systems;Buffer allocation;Complexity;Parallel and distributed programming Message passing Optimal solution Buffer memory Distributed system Buffer system Synchronization Distributed computing Polynomial time
Language	English
License	CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c312t-89d1644c837f5159c9ef1eaf481eba24571765b30c4ebf8da237e88901d0a3e23
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
PQID	34653838
PQPubID	23500
PageCount	20
ParticipantIDs	proquest_miscellaneous_34653838 pascalfrancis_primary_20615329 crossref_primary_10_1016_j_jpdc_2008_06_001 elsevier_sciencedirect_doi_10_1016_j_jpdc_2008_06_001
PublicationCentury	2000
PublicationDate	2008-09-01
PublicationDateYYYYMMDD	2008-09-01
PublicationDate_xml	– month: 09 year: 2008 text: 2008-09-01 day: 01
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	2008
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Aho, Sethi, Ullman (b1) 1986 R. Cypher, E. Leu, Repeatable and portable message-passing programs, in: Proc. of The Symposium on the Principles of Distributed Computing (PODC), 1994, pp. 22–31 Dziong, Liao, Mason (b12) 1993; 25 Kini, Liu, Wu, Wyckoff, Panda (b18) 2003; vol. 2840 Argonne National Lab. MPICH: A portable implementation of mpi. Brodsky, Pedersen, Wagner (b5) 2005; 65 Fox, Johnson, Lyzenga, Otto, Salmon, Walker (b14) 1988; vol. 1 R. Cypher, E. Leu, The semantics of blocking and nonblocking send and receive primitives, in: Proceedings of 8th IEEE International parallel processing symposium (IPPS), 1994, pp. 729–735 2007 Blazewicz, Brzezinkski, Gambosi (b4) 1992; 57 Sheskin (b21) 1975; 8 Garey, Johnson (b15) 1979 Yuzukirmizi, Smith (b26) 2008; 35 J. Fisher, Very long instruction word architectures and ELI-512, in: Proc. Tenth Symposium on Computer Architecture, 1983, pp. 140–150 Cormen, Leiserson, Rivest (b8) 1991 Snir, Otto, Huss-Lederman, Walker, Dongarra (b22) 1996 Jensen (b17) 1992; vol. 1 Dongarra (b11) 1994; 8 Wilkinson, Allen (b25) 2005 M. Reiman, The optimal buffer allocation problem in light traffic, in: IEEE Conference on Decision and Control, 1987 Anantharm (b2) 1989; 35 Lamport (b19) 1978; 21 G. Burns, R. Daoud, J. Vaigl, LAM: An open cluster environment for MPI, in: Proceedings of Supercomputing Symposium, 1994, pp. 379–386 J. Bruck, D. Dolev, C. Ho, M. Rosu, R. Strong, Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations, in: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1995, pp. 64–73 Huber, Jensen, Jepsen, Jensen (b16) 1985; 45 Squyres, Lumsdaine (b23) 2003; vol. 2840 Torres, Kofuji (b24) 1997 10.1016/j.jpdc.2008.06.001_b10 Anantharm (10.1016/j.jpdc.2008.06.001_b2) 1989; 35 10.1016/j.jpdc.2008.06.001_b13 Snir (10.1016/j.jpdc.2008.06.001_b22) 1996 10.1016/j.jpdc.2008.06.001_b3 10.1016/j.jpdc.2008.06.001_b6 Fox (10.1016/j.jpdc.2008.06.001_b14) 1988; vol. 1 Kini (10.1016/j.jpdc.2008.06.001_b18) 2003; vol. 2840 Dziong (10.1016/j.jpdc.2008.06.001_b12) 1993; 25 10.1016/j.jpdc.2008.06.001_b7 10.1016/j.jpdc.2008.06.001_b9 Jensen (10.1016/j.jpdc.2008.06.001_b17) 1992; vol. 1 Aho (10.1016/j.jpdc.2008.06.001_b1) 1986 Brodsky (10.1016/j.jpdc.2008.06.001_b5) 2005; 65 Huber (10.1016/j.jpdc.2008.06.001_b16) 1985; 45 Dongarra (10.1016/j.jpdc.2008.06.001_b11) 1994; 8 Garey (10.1016/j.jpdc.2008.06.001_b15) 1979 10.1016/j.jpdc.2008.06.001_b20 Sheskin (10.1016/j.jpdc.2008.06.001_b21) 1975; 8 Squyres (10.1016/j.jpdc.2008.06.001_b23) 2003; vol. 2840 Yuzukirmizi (10.1016/j.jpdc.2008.06.001_b26) 2008; 35 Torres (10.1016/j.jpdc.2008.06.001_b24) 1997 Wilkinson (10.1016/j.jpdc.2008.06.001_b25) 2005 Blazewicz (10.1016/j.jpdc.2008.06.001_b4) 1992; 57 Cormen (10.1016/j.jpdc.2008.06.001_b8) 1991 Lamport (10.1016/j.jpdc.2008.06.001_b19) 1978; 21
References_xml	– volume: 65 start-page: 692 year: 2005 end-page: 713 ident: b5 article-title: On the complexity of buffer allocation in message passing systems publication-title: Journal of Parallel and Distributed Computing – reference: M. Reiman, The optimal buffer allocation problem in light traffic, in: IEEE Conference on Decision and Control, 1987 – year: 2005 ident: b25 article-title: Parallel Programming. Techniques and Applications Using Networked Workstations and Parallel Computers – volume: vol. 1 year: 1988 ident: b14 publication-title: Solving Problems on Concurrent Processors—General Techniques and Regular Problems – reference: , 2007 – year: 1996 ident: b22 publication-title: MPI: The Complete Reference – volume: 25 start-page: 1065 year: 1993 end-page: 1078 ident: b12 article-title: Effective bandwidth allocation and buffer dimensioning in ATM based networks with priorities publication-title: Computer Networks and ISDN Systems – reference: R. Cypher, E. Leu, The semantics of blocking and nonblocking send and receive primitives, in: Proceedings of 8th IEEE International parallel processing symposium (IPPS), 1994, pp. 729–735 – volume: 45 start-page: 261 year: 1985 end-page: 292 ident: b16 article-title: Reachability trees for high-level Petri nets publication-title: Theoretical Computer Science – reference: R. Cypher, E. Leu, Repeatable and portable message-passing programs, in: Proc. of The Symposium on the Principles of Distributed Computing (PODC), 1994, pp. 22–31 – volume: vol. 2840 start-page: 379 year: 2003 end-page: 387 ident: b23 article-title: A component architecture for LAM/MPI publication-title: Proceedings, 10th European PVM/MPI Users’ Group Meeting – volume: vol. 2840 start-page: 369 year: 2003 end-page: 378 ident: b18 article-title: Fast and scalable barrier using RDMA and multicast mechanisms for infiniband-based clusters publication-title: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 10th European PVM/MPI Users’ Group Meeting – year: 1986 ident: b1 article-title: Compilers: Principles and Techniques and Tools – start-page: 429 year: 1997 end-page: 432 ident: b24 article-title: The barrier synchronization impact on the MPI programs performance using a cluster of workstations publication-title: Proceedings of the Third International IEEE Symposium on Parallel Architectures, Algorithms and Networks – volume: 8 start-page: 165 year: 1994 end-page: 184 ident: b11 article-title: MPI: A message passing interface standard publication-title: The International Journal of Supercomputers and High Performance Computing – reference: J. Fisher, Very long instruction word architectures and ELI-512, in: Proc. Tenth Symposium on Computer Architecture, 1983, pp. 140–150 – year: 1979 ident: b15 article-title: Computers and Intractibility: A Guide to the Theory of NP-Completeness – volume: 35 start-page: 2579 year: 2008 end-page: 2598 ident: b26 article-title: Optimal buffer allocation in finite closed networks with multiple servers publication-title: Computers & Operations Research – reference: Argonne National Lab. MPICH: A portable implementation of mpi. – reference: J. Bruck, D. Dolev, C. Ho, M. Rosu, R. Strong, Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations, in: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, July 1995, pp. 64–73 – volume: 57 start-page: 1 year: 1992 end-page: 12 ident: b4 article-title: Optimization aspects of deadlock prevention in packet-switching networks publication-title: European Journal of Optimization Research – reference: G. Burns, R. Daoud, J. Vaigl, LAM: An open cluster environment for MPI, in: Proceedings of Supercomputing Symposium, 1994, pp. 379–386 – year: 1991 ident: b8 article-title: Introduction to Algorithms – volume: 35 start-page: 721 year: 1989 end-page: 725 ident: b2 article-title: The optimal buffer allocation problem publication-title: IEEE Transactions on Information Theory – volume: 21 start-page: 558 year: 1978 end-page: 565 ident: b19 article-title: Time, clocks and the orderings of events in a distributed system publication-title: Communications of the ACM – volume: vol. 1 year: 1992 ident: b17 publication-title: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use – volume: 8 year: 1975 ident: b21 article-title: Allocation of interstage storage along an automatic production line publication-title: AIEE Transactions – volume: 65 start-page: 692 year: 2005 ident: 10.1016/j.jpdc.2008.06.001_b5 article-title: On the complexity of buffer allocation in message passing systems publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2004.10.009 – volume: 21 start-page: 558 year: 1978 ident: 10.1016/j.jpdc.2008.06.001_b19 article-title: Time, clocks and the orderings of events in a distributed system publication-title: Communications of the ACM doi: 10.1145/359545.359563 – volume: vol. 2840 start-page: 369 year: 2003 ident: 10.1016/j.jpdc.2008.06.001_b18 article-title: Fast and scalable barrier using RDMA and multicast mechanisms for infiniband-based clusters – year: 1991 ident: 10.1016/j.jpdc.2008.06.001_b8 – volume: 45 start-page: 261 year: 1985 ident: 10.1016/j.jpdc.2008.06.001_b16 article-title: Reachability trees for high-level Petri nets publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(86)90046-0 – volume: vol. 1 year: 1992 ident: 10.1016/j.jpdc.2008.06.001_b17 – volume: 35 start-page: 721 issue: 4 year: 1989 ident: 10.1016/j.jpdc.2008.06.001_b2 article-title: The optimal buffer allocation problem publication-title: IEEE Transactions on Information Theory doi: 10.1109/18.32150 – start-page: 429 year: 1997 ident: 10.1016/j.jpdc.2008.06.001_b24 article-title: The barrier synchronization impact on the MPI programs performance using a cluster of workstations – year: 1979 ident: 10.1016/j.jpdc.2008.06.001_b15 – volume: 25 start-page: 1065 issue: 10 year: 1993 ident: 10.1016/j.jpdc.2008.06.001_b12 article-title: Effective bandwidth allocation and buffer dimensioning in ATM based networks with priorities publication-title: Computer Networks and ISDN Systems doi: 10.1016/0169-7552(93)90067-E – volume: 57 start-page: 1 year: 1992 ident: 10.1016/j.jpdc.2008.06.001_b4 article-title: Optimization aspects of deadlock prevention in packet-switching networks publication-title: European Journal of Optimization Research doi: 10.1016/0377-2217(92)90300-X – ident: 10.1016/j.jpdc.2008.06.001_b13 doi: 10.1145/800046.801649 – year: 1996 ident: 10.1016/j.jpdc.2008.06.001_b22 – volume: 35 start-page: 2579 issue: 8 year: 2008 ident: 10.1016/j.jpdc.2008.06.001_b26 article-title: Optimal buffer allocation in finite closed networks with multiple servers publication-title: Computers & Operations Research doi: 10.1016/j.cor.2006.12.008 – volume: 8 start-page: 165 year: 1994 ident: 10.1016/j.jpdc.2008.06.001_b11 article-title: MPI: A message passing interface standard publication-title: The International Journal of Supercomputers and High Performance Computing – ident: 10.1016/j.jpdc.2008.06.001_b10 doi: 10.1109/IPPS.1994.288223 – volume: 8 issue: 1 year: 1975 ident: 10.1016/j.jpdc.2008.06.001_b21 article-title: Allocation of interstage storage along an automatic production line publication-title: AIEE Transactions – ident: 10.1016/j.jpdc.2008.06.001_b6 doi: 10.1145/215399.215421 – volume: vol. 2840 start-page: 379 year: 2003 ident: 10.1016/j.jpdc.2008.06.001_b23 article-title: A component architecture for LAM/MPI – volume: vol. 1 year: 1988 ident: 10.1016/j.jpdc.2008.06.001_b14 – ident: 10.1016/j.jpdc.2008.06.001_b20 doi: 10.1109/CDC.1987.272666 – year: 1986 ident: 10.1016/j.jpdc.2008.06.001_b1 – ident: 10.1016/j.jpdc.2008.06.001_b7 – ident: 10.1016/j.jpdc.2008.06.001_b9 doi: 10.1145/197917.197940 – ident: 10.1016/j.jpdc.2008.06.001_b3 – year: 2005 ident: 10.1016/j.jpdc.2008.06.001_b25
SSID	ssj0011578
Score	1.8084859
Snippet	The correctness of applications that perform asynchronous message passing typically relies on the underlying hardware having a sufficient amount of memory...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Publisher
StartPage	1263
SubjectTerms	Applied sciences Buffer allocation Complexity Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Message passing systems Parallel and distributed programming Software
Title	Approximating the buffer allocation problem using epochs
URI	https://dx.doi.org/10.1016/j.jpdc.2008.06.001 https://www.proquest.com/docview/34653838
Volume	68
WOSCitedRecordID	wos000258732400008&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: PRVESC databaseName: ScienceDirect Freedom Collection customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbKxgMSGteJchl54C0KSuwkth87KOLaTWyg8hTZiQMrVRYtTdWfz3Fsp-2mcXngJWotNal8vpzz-VwRehFxWkY05YEEZRfEUcgCESoRsCLOVYEBAV30_OtHOpmw6ZQfDwZLVwuznNOqYqsVr_-rqGENhK1LZ_9B3P1NYQE-g9DhCmKH618JfqS7hK_ONBO1lVCy1UNQfB1iNw46346R8dvOUwAcPP_RXENTdW_w-VyZjgKFbrOrJ2SprhiubhfO8mntOtb1CuOJSb6t_EOhfn4Xtmq_O_J_Pnp98uGbq6vpnTujT8cnR5ONurItVwTrc62sf8wa8w0VphugUmIKNp2-TdkGrviG8oyw1XXKfjVjia4oeeNvmL2c1UVus2G7iNLapLkw_iVL1-cfYk3kCOY30C6mCQdtuDt6N56-7-NPUWJsuPv_ttzKZAZefu51lOZ2LRp40UozIeWKse8YzOldtGdl6o0MZO6hgaruozv2GOJZJd_Akpv04dYeILYFKg9A5RlQeWtQeRZUXgcqz4DqIfryZnz66m1gZ24EOYnwImC8gAN0nDNCS011c67KSIkyZpGSAscJHP_TRJIwj5UsWSEwoYoxYJVFKIjCZB_tVOeVeoQ8TkpBuQqxiMo4kUriSOYSSyYTRVmaDpHvti2rTWuVzOUczjK9yXZGapd4OUSJ29nMkkND-jKAxW9_d7Alhv5RDgND9NzJJQPVquNlolLnbZMR3XuQEfb4T7d4gm6tX4enaGdx0apn6Ga-XJw1FwcWW78A0bGY0A
linkProvider	Elsevier
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=Approximating+the+buffer+allocation+problem+using+epochs&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=PEDERSEN%2C+Jan+Baekgaard&rft.au=BRODSKY%2C+Alex&rft.au=SAMPSON%2C+Jeffrey&rft.date=2008-09-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=68&rft.issue=9&rft.spage=1263&rft.epage=1282&rft_id=info:doi/10.1016%2Fj.jpdc.2008.06.001&rft.externalDBID=n%2Fa&rft.externalDocID=20615329
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon