Abstract
In contrast to many scientific applications that perform computations on fixed-size arrays, symbolic programs process complex data structures represented as lists, sets, and graphs that are allocated and deallocated in a variable pattern during execution. Much of the processing in symbolic computation involves following linked lists by tracing chains of pointers through scattered locations in memory. Execution speeds for single serial processors are therefore limited by the time it takes to make random retrievals of individual words of data from memory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
