{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:47:48Z","timestamp":1725634068422},"publisher-location":"London","reference-count":25,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540760689"},{"type":"electronic","value":"9781447115045"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/978-1-4471-1504-5_9","type":"book-chapter","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T12:31:03Z","timestamp":1321446663000},"page":"119-134","source":"Crossref","is-referenced-by-count":0,"title":["Capturing Branch-and-Bound using Shared Abstract Data-types"],"prefix":"10.1007","author":[{"given":"Don","family":"Goodeve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Briggs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Davy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"483","volume-title":"Validity of the single-processor approach to achieving large scale computing capabilities","author":"GM Amdahl","year":"1967","unstructured":"G M Amdahl. Validity of the single-processor approach to achieving large scale computing capabilities. In AFIPS Conference proceedings, pages 483\u2013485, April 1967."},{"key":"9_CR2","volume-title":"Programming Distributed Systems","author":"H Bal","year":"1990","unstructured":"Henri Bal. Programming Distributed Systems. Prentice-Hall, 1990."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Henri E. Bal, M. Franz Kaashoek, and Andrew S. Tannenbaum. Orea: A Language for Parallel Programming of Distributed Systems. IEEE Transactions on So\u00dfware Engineering, 18(3), March 1992.","DOI":"10.1109\/32.126768"},{"key":"9_CR4","unstructured":"Robert Briggs. An Accumulator SADT: Implementation and Concurrent Semantics. Final Year Project Report (Unpublished), School of Computer Studies, University of Leeds, 1995."},{"key":"9_CR5","volume-title":"Concurrent Aggregates","author":"AA Chien","year":"1993","unstructured":"Andrew A. Chien. Concurrent Aggregates. MIT Press, 1993."},{"key":"9_CR6","volume-title":"Algorithmic Skeletons: Structured Management of Parallel Computation","author":"M Cole","year":"1989","unstructured":"M. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. Pitman\/MIT Press, 1989."},{"key":"9_CR7","volume-title":"Parallel Languages and Architectures, Europe 1993","author":"J Darlington","year":"1993","unstructured":"J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N Sharp, and Q. Wu. Parallel Programming Using Skeleton Functions. In Parallel Languages and Architectures, Europe 1993, 1993."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":">Carla Schlatter Ellis. Concurrent Search and Insertion in AVL Trees. IEEE Transactions on Computers, C-29(9), September 1980.","DOI":"10.1109\/TC.1980.1675680"},{"key":"9_CR9","volume-title":"Abstract Machine Models for Parallel and Distributed Computing","author":"D Goodeve","year":"1996","unstructured":"Don Goodeve, John Davy, Peter Dew, and Jonathan Nash. Concurrent Sharing through Abstract Data-types: A Case Study. In M. Kara et al., editor, Abstract Machine Models for Parallel and Distributed Computing. IOS Press, 1996."},{"key":"9_CR10","first-page":"518","volume-title":"Transputer Applications and Systems \u201995","author":"D Goodeve","year":"1995","unstructured":"Don Goodeve, John Davy, and Chris Wadsworth. Shared Accumulators. In Transputer Applications and Systems \u201995, pages 518\u2013528. IOS Press, 1995."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/TC.1983.1676201","volume":"C-32","author":"A Gottlieb","year":"1983","unstructured":"A. Gottlieb, R. Grishman, C. P. Kruskal, K. M. McAuliffe, L. Rudolph, and M. Snir. The NYU Ultracomputer \u2014 Designing an MIMD Shared Memory Parallel Computer. IEEE Transactions on Computers, C-32(2):175\u2013189, February 1983.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, 12(3):463\u2013492, July 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jpdc.1994.1097","volume":"22","author":"T Johnson","year":"1994","unstructured":"T. Johnson. A Highly Concurrent Priority Queue. Journal of Parallel and Distributed Computing, 22(2):367\u2013373, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR14","first-page":"521","volume-title":"Transputer Applications and Systems \u201993","author":"N Kuck","year":"1993","unstructured":"Nobert Kuck, Martin Middendorf, and Hartmut Schmeck. Generic Branch and Bound on Transputers. In R. Grebe et al., editor, Transputer Applications and Systems \u201993, pages 521\u2013535. IOS Press, 1993."},{"key":"9_CR15","unstructured":"Sandeep Kumar and Dharma P. Agrawal. CORE: A Solution to the Inheritance Anomaly in Concurrent Object-Oriented Languages. In A. Kumar and K. Kamel, editors,Parallel and Distributed Computing and Systems \u201996, pages 75\u201381. ICSA, October 14\u201316, 1993."},{"issue":"6","key":"9_CR16","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/358080.358103","volume":"27","author":"L Ten-Hwang","year":"1984","unstructured":"Ten-Hwang Lai and Sartaj Sahni. Anomalies in Parallel Branch-and- Bound Algorithms.Communications of the ACM, 27(6):594\u2013602, June 1984.","journal-title":"Communications of the ACM"},{"issue":"9","key":"9_CR17","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L Lamport","year":"1979.","unstructured":"Leslie Lamport. How to make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Transactions on Computers, C-28(9):690\u2013691, September 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"9_CR18","first-page":"211","volume-title":"Concurrent set manipulation without locking","author":"V Lanin","year":"1988.","unstructured":"Vladmir Lanin and Dennis Shasha. Concurrent set manipulation without locking. In 7th ACM Symposium on the Principlies of Database Systems, pages 211\u2013220, March 1988."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"DCJ Little","year":"1963","unstructured":"John D.C. Little, Katta G. Murty, Dura W. Sweeney, and Caroline Karel. An Algorithm for the Travelling Salesman Problem. Operations Research, 11:972\u2013989, 1963.","journal-title":"Operations Research"},{"key":"9_CR20","first-page":"781","volume-title":"Transputing \u201991","author":"GP McKeown","year":"1991","unstructured":"G.P. McKeown, V.J. Rayward-Smith, S.A. Rush, and H.J. Turpin. Using a Transputer network to solve Branch-and-Bound problems. In P. Welch et al., editor, Transputing \u201991, pages 781\u2013799. IOS Press, 1991."},{"key":"9_CR21","unstructured":"Greg Nelson. Systems Programming with Modula-3. Prentice-Hall series in Innovative Computer Science. Prentice-Hall, 1991."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02024489","volume":"43","author":"VJ Rayward-Smith","year":"1993","unstructured":"V.J. Rayward-Smith, S.A. Rush, and G.P. McKeown. Efficiency considerations in the implementation of parallel branch-and-bound. Annals of Operations Research, 43:123\u2013145, 1993.","journal-title":"Annals of Operations Research"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Nir Shavit and Dan Touitou. Elimination Trees and the Construction of Pools and Stacks. In 7th Annual Symposium on Parallel Algorithms and Architectures, pages 54\u201363. ACM Press, April 26th, 1995.","DOI":"10.1145\/215399.215419"},{"issue":"l","key":"9_CR24","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/40.342017","volume":"15","author":"T Eicken von","year":"1995","unstructured":"Thorsten von Eicken, Anindya Basu, and Vineet Buch. Low-Latency Communication Over ATM Networks Using Active Messages. IEEE Micro, 15(l):46\u201353, 1995.","journal-title":"IEEE Micro"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jpdc.1993.1015","volume":"17","author":"JM Wing","year":"1993","unstructured":"Jeanette M. Wing and Chun Gong. Testing and Verifying Concurrent Objects. Journal of Parallel and Distributed Computing, 17:164\u2013182,1993.","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["UK Parallel \u201996"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-1504-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:47:07Z","timestamp":1605678427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-1504-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540760689","9781447115045"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-1504-5_9","relation":{},"subject":[],"published":{"date-parts":[[1996]]}}}