{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T04:18:49Z","timestamp":1774671529875,"version":"3.50.1"},"reference-count":20,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,20]],"date-time":"2006-10-20T00:00:00Z","timestamp":1161302400000},"content-version":"vor","delay-in-days":5802,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency: Pract. Exper."],"published-print":{"date-parts":[[1990,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It is intended to operate on a collection of heterogeneous computing elements interconnected by one or more networks. The participating processors may be scalar machines, multiprocessors, or special\u2010purpose computers, enabling application components to execute on the architecture most appropriate to the algorithm. PVM provides a straightforward and general inferface that permits the description of various types of algorithms (and their interactions), while the underlying infrastructure permits the execution of applications on a virtual computing environment that supports multiple parallel computation models. PVM contains facilities for concurrent, sequential or conditional execution of application components, is portable to a variety of architectures, and supports certain forms of error detection and recovery.<\/jats:p>","DOI":"10.1002\/cpe.4330020404","type":"journal-article","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T06:18:15Z","timestamp":1163830695000},"page":"315-339","source":"Crossref","is-referenced-by-count":737,"title":["PVM: A framework for parallel distributed computing"],"prefix":"10.1002","volume":"2","author":[{"given":"V. S.","family":"Sunderam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,20]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Computer Architecture and Parallel Processing","author":"Hwang K.","year":"1984"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90038-0"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"H.Narang R.FlaneryandJ.Drake Design of a Simulation Interface for a Parallel Computing Environment in Proc. ACM Southeastern Regional Conference April1990 to be published.","DOI":"10.1145\/98949.99120"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(87)90060-3"},{"key":"e_1_2_1_6_2","unstructured":"G. A.Geist M. T.Heath B. W.PeytonandP. H.Worley A Machine Independent Communication Library in Proc. Hypercube Concurrent Computers Conference1989 J. Gustafson (ed.) to be published."},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"T. J.Gardner et. al. DPUP: A Distributed Processing Utilities Package Computer Science Technical Report University of Colorado Boulder 1986.","DOI":"10.21236\/ADA456864"},{"key":"e_1_2_1_8_2","unstructured":"T. H.Dunigan Hypercube Simulation on a Local Area Network Oak Ridge National Laboratory Report ORNL\/TM\u201010685 November1988."},{"key":"e_1_2_1_9_2","unstructured":"C.Seitz J.SeizovicandW. K.Su The C programmer's Abbreviated Guide to Multicomputer Programming Caltech Computer Science Report CS\u2010TR\u201088\u20101 January1988."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"J. S.Chaseet. al. The Amber System: Parallel Programming on a Network of Multiprocessors 12th SOSP Litchfield Park November1989 to be published.","DOI":"10.1145\/74850.74865"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"M.SullivanandD.Anderson Marionette: A System for Parallel Distributed Programming Using a Master\/Slave Model Proc. 9th ICDS June1989 p.p.181\u2013188.","DOI":"10.21236\/ADA620734"},{"key":"e_1_2_1_12_2","unstructured":"G.Riccardi B.TraverstatandU.Chandra A Master\u2010Slaves Parallel Computation Model Supercomputer Research Institute Report Florida State University June1989."},{"key":"e_1_2_1_13_2","volume-title":"Intel iPSC\/2 Programmer's Reference Manual","year":"1988"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"A.Karp Programming for Parallelism IEEE Computer May1987 pp.43\u201357.","DOI":"10.1109\/MC.1987.1663563"},{"key":"e_1_2_1_15_2","volume-title":"Guide to Parallel Programming on Sequent Computer Systems","author":"Osterhaug A.","year":"1986"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"J. B.Postel User Datagram Protocol Internet Request for Comments RFC\u2010768 August1980.","DOI":"10.17487\/rfc0768"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"N.Maekawa \u2018An algorithm for mutual exclusion in decentralized systems\u2019 ACM Trans. Comput. Syst.(February) 145\u2013159(1985).","DOI":"10.1145\/214438.214445"},{"key":"e_1_2_1_18_2","doi-asserted-by":"crossref","unstructured":"K.Raymond \u2018A tree based algorithm for distributed mutual exclusion\u2019 ACM Trans. Comput. Syst.(February)61\u201377(1989).","DOI":"10.1145\/58564.59295"},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","unstructured":"D.AgarwalandA. E.Abbadi An Efficient Solution to the Distributed Mutual Exclusion Problem in Proc. Principles of Distributed Computing Conference Edmonton August1989.","DOI":"10.1145\/72981.72994"},{"key":"e_1_2_1_20_2","unstructured":"R.Finkel E.StyerandU.Manber Designing Efficient Barriers in Communication NetworksUniversity of Kentucky Technical Report No. 165\u201090 March 1990."},{"key":"e_1_2_1_21_2","first-page":"161","volume-title":"Hypercube Multiprocessors 1986","author":"Geist G. A.","year":"1986"}],"container-title":["Concurrency: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4330020404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4330020404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:31:47Z","timestamp":1697967107000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4330020404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["10.1002\/cpe.4330020404"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4330020404","archive":["Portico"],"relation":{},"ISSN":["1040-3108","1096-9128"],"issn-type":[{"value":"1040-3108","type":"print"},{"value":"1096-9128","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}