Compiler having automatic common blocks of memory splitting

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395709, 395701, 711 3, 711118, 711122, G06F 1206, G06F 1208

Patent

active

058482750

ABSTRACT:
In a computer system having a cache memory and a main memory for storing data, a method for laying out blocks of data to minimize a number of memory transfers between the cache memory and the main memory. Memory layout normally occurs at link time, after all the source files have been compiled. The code is compiled with the assumption that the memory blocks can be optimally placed. The linker then determines whether there has been any memory violations. Memory violations are marked. All marked memory locations are then placed in a layout that satisfies adjacency requirements.

REFERENCES:
patent: 4613935 (1986-09-01), Couleur
patent: 4991088 (1991-02-01), Kam
patent: 5193180 (1993-03-01), Hastings
patent: 5497458 (1996-03-01), Finch et al.
patent: 5644709 (1997-07-01), Austin
patent: 5649161 (1997-07-01), Andrade et al.
Per Ling. "A Set of High-Performance Level 3 BLAS Structured and Tuned for the IBM 3090 VF and Implemented in Fortran 77." Sep. 1993. The Journal of Supercomputing No. 3. Boston, US.
J.E. Aull. "Validation Using CASE Tools." Apr. 5, 1992. IEEE.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Compiler having automatic common blocks of memory splitting does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compiler having automatic common blocks of memory splitting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiler having automatic common blocks of memory splitting will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-188855

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.