{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:57:26Z","timestamp":1776956246996,"version":"3.51.4"},"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":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2005,1]]},"abstract":"<jats:p>The paper presents a performance model that can be used to optimally distribute computations over heterogeneous computers. This model is application\u2010centric representing the speed of each computer by a function of the problem size. This way it takes into account the processor heterogeneity, the heterogeneity of memory structure, and the memory limitations at each level of memory hierarchy. A problem of optimal partitioning of an <jats:bold>n<\/jats:bold>\u2010element set over <jats:bold>p<\/jats:bold> heterogeneous processors using this performance model is formulated, and its efficient solution of the complexity O(<jats:bold>p<\/jats:bold><jats:sup>3<\/jats:sup>\u00d7 log<jats:sub>2<\/jats:sub><jats:bold>n<\/jats:bold>) is given.<\/jats:p>","DOI":"10.1155\/2005\/964902","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T13:55:48Z","timestamp":1421070948000},"page":"93-112","source":"Crossref","is-referenced-by-count":18,"title":["Data Partitioning for Multiprocessors with Memory Heterogeneity and Memory Constraints"],"prefix":"10.1155","volume":"13","author":[{"given":"Alexey","family":"Lastovetsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2005,12]]},"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2005\/964902.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2005\/964902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T03:24:40Z","timestamp":1723087480000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2005\/964902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["10.1155\/2005\/964902"],"URL":"https:\/\/doi.org\/10.1155\/2005\/964902","archive":["Portico"],"relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"value":"1058-9244","type":"print"},{"value":"1875-919X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}