{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T05:10:04Z","timestamp":1723093804360},"reference-count":0,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":23,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>CX, a network\u2010based computational exchange, is presented. The system\u2032s design integrates variations of ideas from other researchers, such as work stealing, non\u2010blocking tasks, eager scheduling, and space\u2010based coordination. The object\u2010oriented API is simple, compact, and cleanly separates application logic from the logic that supports interprocess communication and fault tolerance. Computations, of course, run to completion in the presence of computational hosts that join and leave the ongoing computation. Such hosts, or producers, use task caching and prefetching to overlap computation with interprocessor communication. To break a potential task server bottleneck, a network of task servers is presented. Even though task servers are envisioned as reliable, the self\u2010organizing, scalable network of  <jats:italic>n<\/jats:italic>\u2010 servers, described as a <jats:italic>sibling-connected height-balanced fat tree<\/jats:italic>, tolerates a sequence of <jats:italic>n<\/jats:italic>\u20101 server failures. Tasks are distributed throughout the server network via a simple \"diffusion\" process. CX is intended as a test bed for research on automated silent auctions, reputation services, authentication services, and bonding services. CX also provides a test bed for algorithm research into network\u2010based parallel computation.<\/jats:p>","DOI":"10.1155\/2002\/598245","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T14:00:10Z","timestamp":1421071210000},"page":"159-171","source":"Crossref","is-referenced-by-count":0,"title":["CX: A Scalable, Robust Network for Parallel Computing"],"prefix":"10.1155","volume":"10","author":[{"given":"Peter","family":"Cappello","sequence":"first","affiliation":[]},{"given":"Dimitrios","family":"Mourloukos","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[1999,12,9]]},"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2002\/598245.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2002\/598245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T04:40:17Z","timestamp":1723092017000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2002\/598245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12,9]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1155\/2002\/598245"],"URL":"https:\/\/doi.org\/10.1155\/2002\/598245","archive":["Portico"],"relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"type":"print","value":"1058-9244"},{"type":"electronic","value":"1875-919X"}],"subject":[],"published":{"date-parts":[[1999,12,9]]}}}