Please use this identifier to cite or link to this item:
https://doi.org/10.1007/BF02262105
DC Field | Value | |
---|---|---|
dc.title | A conflict free memory access in parallel image reconstruction | |
dc.contributor.author | Nowinski, W.L. | |
dc.date.accessioned | 2014-11-27T09:44:50Z | |
dc.date.available | 2014-11-27T09:44:50Z | |
dc.date.issued | 1994-03 | |
dc.identifier.citation | Nowinski, W.L. (1994-03). A conflict free memory access in parallel image reconstruction. Computing 53 (1) : 1-11. ScholarBank@NUS Repository. https://doi.org/10.1007/BF02262105 | |
dc.identifier.issn | 0010485X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/111124 | |
dc.description.abstract | The paper addresses a conflict free access to the memory in parallel image reconstruction. A simultaneous memory access is discussed in terms of the forms of parallelism specific to image reconstruction. Two types of mapping of the projection space onto the image space are defined and their influence on a simultaneous memory access is analysed. Finally, two approaches allowing to attain a conflict free memory access are proposed: parallelism degree restriction and memory access synchronization. © 1994 Springer-Verlag. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/BF02262105 | |
dc.source | Scopus | |
dc.subject | AMS Subject Classification: 68U99 | |
dc.subject | conflict free memory access | |
dc.subject | forms of parallelism | |
dc.subject | Image reconstruction | |
dc.subject | occam | |
dc.subject | parallel processing | |
dc.type | Article | |
dc.contributor.department | INSTITUTE OF SYSTEMS SCIENCE | |
dc.description.doi | 10.1007/BF02262105 | |
dc.description.sourcetitle | Computing | |
dc.description.volume | 53 | |
dc.description.issue | 1 | |
dc.description.page | 1-11 | |
dc.identifier.isiut | A1994PE57200001 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.