Synthesis of XOR storage schemes with different cost for minimization of memory contention

Conference Proceedings of the EUROMICRO

Volumn 1, Issue , 1999, Pages 170-177

  Chen, Song ^a   Postula, Adam ^a   Jozwiak, Lech ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS EFFICIENCIES; ADDRESS GENERATION; IMPLEMENTATION COST; MEMORY BANDWIDTHS; MEMORY CONTENTIONS; PARALLEL IMAGE PROCESSING; SIMULATION STUDIES; STORAGE SCHEMES;

COSTS; IMAGE PROCESSING; INFORMATION SCIENCE; MEMORY ARCHITECTURE;

DIGITAL STORAGE;

EID: 48049115209     PISSN: 10896503     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EURMIC.1999.794463     Document Type: Conference Paper

References (18)

1. D. H. Bailey, "Vector computer memory bank contention," IEEE Trans. Computers, vol. 36, no. 3, pp. 293-298, 1987.
2. P. Budnik and D. J. Kuck, "The organization and use of parallel memories," IEEE Trans. Computers, vol. 20, no. 12, pp. 1566-1569, 1971.
3. D. H. Lawrie, "Access and alignment of data in an array processor," IEEE Trans. Computers, vol. 24, no. 12, pp. 1145-1155, 1975.
4. D. H. Lawrie and C. R. Vora, "The prime memory system for array access," IEEE Trans. Computers, vol. 31, no. 5, pp. 435-442, 1982.
5. H. A. G. Wijshoff and J. van Leeuwen, "The structure of periodic storage schemes for parallel memories," IEEE Trans. Computers, vol. 34, no. 6, pp. 501-505, 1985.
6. A. Deb, "Multiskewing-A novel technique for optimal parallel memory access," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 595-604, 1996.
7. J. M. Frailong, W. Jalby, and J. Lenfant, "XOR-schemes: a flexible data organization in parallel memories," in Proceedings of the International Conference on Parallel Processing, 1985, pp. 276-283.
8. L. De Lei, "On access and alignment of data in a parallel processor," Information Processing Letters, vol. 33, no. 1, pp. 11-14, 1989.
9. K. Kim and V. K. P. Kumar, "Parallel memory systems for image processing," in Proceedings CVPR '89 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 1989, pp. 654-659.
10. R. V. Boppana and C. S. Raghavendra, "Generalized schemes for access and alignment of data in parallel processors with self-routing interconnection networks," J. Parallel and Distributed Computing, vol. 11, no. 2, pp. 97-111, 1991.
11. G. S. Sohi, "High-bandwidth interleaved memories for vector processors-A simulation study," IEEE Trans. Computers, vol. 42, no. 1, pp. 34-44, 1993.
12. A. Norton and E. Melton, "A class of Boolean linear transformations for conflict-free power-of-two stride access," in Proceedings of the International Conference on Parallel Processing, 1987, pp. 247-254.
13. L. Zhiyong and L. Xiaobo, "XOR storage schemes for frequently used data patterns," J. Parallel and Distributed Computing, vol. 25, no. 2, pp. 162-173, 1995.
14. D. T. Harper, III, "Block, multistride vector, and FFT accesses in parallel memory systems," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 43-51, 1991.
15. M. Al Mouhamed, L. Bic, and H. Abu Haimed, "A compiler address transformation for conflict-free access of memories and networks," in Proceedings. Eighth IEEE Symposium on Parallel and Distributed Processing, 1996, pp. 530-537.
16. M. A. Al Mouhamed and S. S. Seiden, "Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems," IEEE Trans. Computers, vol. 45, no. 6, pp. 757-762, 1996.
17. M. A. Al Mouhamed and S. S. Seiden, "A heuristic storage for minimizing access time of arbitrary data patterns," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 441-447, 1997.
18. L. Davis, Handbook of genetic algorithms. New York: Van Nostrand Reinhold, 1991.