Electrical computers and digital processing systems: memory – Storage accessing and control – Shared memory area
Reexamination Certificate
2007-08-07
2007-08-07
Lane, Jack A. (Department: 2185)
Electrical computers and digital processing systems: memory
Storage accessing and control
Shared memory area
C710S033000
Reexamination Certificate
active
10911224
ABSTRACT:
Computer system for electronic data processing having programmable data transfer units used for transferring data from a first memory in which data is stored in a form of a multi-dimensional array to a second memory in such a way, that spatial or temporal locality for the transfer is established.
REFERENCES:
Amarasinghe, Saman Prabhath, “Parallelizing Compiler Techniques Based on Linear Inequalities”, Disseration, University of Stanford, 1997.
Ancourt, Corinne, et al., “Scannin Polyhedra with DO Loops”, 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1991, pp. 39-50.
O'Boyle, M.F.P., et al., “Non-Singular Data Transformations: Definition, Validity and Applications”, Int. J. of Parallel Programming, 1999, vol. 27, No. 3, pp. 131-159.
Clauss, Philippe, et al., “Automatic Memory Layout Transformations to Optimize Spatial Locality in Parameterized Loop Nests”, ACM SIGARCH Computer Architecture News, Mar. 2000, vol. 28, No. 1.
Numerical C Extensions Group of X3J11, Data Parallel C Extensions, Technical Report, Version 1.6, 1994.
Mongenet, Catherine, “Affine dependence classification for communications minimization”, International Journal of Parallel Programming, 1997, vol. 25, No. 6.
Schrijver, Alexander, “Theory of lattices and linear diophantine equations”, Theory of Linear and Integer Programming, Wiley, 2000.
Sloik, Adrian, “Volume Driven Selection of Loop and Data Transformations for Cache-Coherent Parallel Processors”, Dissertation, University of Paderborn, 1999.
Wolf, Michael E., et al., “A Data Locality Optimizing Algorithm”, Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, 1991, pp. 30-44.
Strout, Michelle Mills, et al., “Schedule-Independent Storage Mapping for Loops”, Architectural Support for Programming Languages and Operating Systems, 1998, pp. 24-33.
Thies, William, et al., “A Unified Framework for Schedule and Storage Optimization”, Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, 2001, pp. 232-242.
Quillere, Fabien, et al., “Optimizing memory usage in the polyhedral model”, ACM Transactions on Programming Languages and Systems, 2000, vol. 22, No. 5, pp. 773-815.
Lim, Amy W., et al., “Blocking and Array Contraction Across Arbitrarily Nested Loops Using Affine Partitioning”, Proceedings of the 8th ACM SIGPLAN symposium on Principles and Practices of Parallel Programming, 2001, pp. 103-112.
Wolf, Michael Edward; “Improving Locality and Parallelism in Nested Loops”; A Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements For the Degree of Doctor of Philosophy; 1992.
Richter Mathias
Sauermann Mirko
Dickstein , Shapiro, LLP.
Infineon - Technologies AG
Lane Jack A.
LandOfFree
Computer system for data processing and method for the... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer system for data processing and method for the..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer system for data processing and method for the... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3858874