{"id":14728,"date":"2022-05-26T22:20:30","date_gmt":"2022-05-27T02:20:30","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=14728"},"modified":"2026-06-09T11:14:34","modified_gmt":"2026-06-09T15:14:34","slug":"tr-58-computer-access-methods-for-extendible-arrays-of-varying-dimensions","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1984\/tr-58-computer-access-methods-for-extendible-arrays-of-varying-dimensions\/","title":{"rendered":"TR-58: Computer Access Methods for Extendible Arrays of Varying Dimensions"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-58: Computer Access Methods for Extendible Arrays of Varying Dimensions\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1984\/\">Technical Report<\/a>&nbsp;<strong>TR-58<\/strong><br>August 1984<\/p>\n\n\n\n<h2 id=\"computer-access-methods-for-extendible-arrays-of-varying-dimensions\" class=\"wp-block-heading\">Computer Access Methods for Extendible Arrays of Varying Dimensions<\/h2>\n\n\n\n<p>E. Otoo<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>We introduce a method of managing storage for dense rectangular arrays in consecutive memory locations such that the number of dimensions as well as the index range of each dimension can be extendible. The method realizes an n-element array of any shape in 8(n.) storage locations with a computed access function of complexity O(d2), where1 n and d are respectively, the size and dimensionality of the array at any instant. This presents a solution to a. more difficult variant of an open question of Rosenberg that asks whether or not a. realization exists which favours non-trivial infinite family of shapes such that an array of n elements is spread over at most C \u2022 n locations for some integer C. We show that C 3.25 for any d and n &gt; &gt; cl.<\/p>\n\n\n\n<h3 id=\"download\" class=\"wp-block-heading\">Download<\/h3>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-58.pdf\">TR-58.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report&nbsp;TR-58August 1984 Computer Access Methods for Extendible Arrays of Varying Dimensions E. Otoo Abstract We introduce a method of managing storage for dense rectangular arrays in consecutive memory locations such that the number of dimensions as well as the index range of each dimension can be extendible. The method realizes an n-element array [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11787,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[88],"class_list":["post-14728","page","type-page","status-publish","hentry","cu_page_type-technical-report"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14728","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=14728"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14728\/revisions"}],"predecessor-version":[{"id":24555,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14728\/revisions\/24555"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11787"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=14728"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=14728"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}