Temporal and Spatial Locality

When referencing data items, the closer the instruction is to the processor the faster it can be accessed. The principle of locality is broken down into two types, temporal locality and spatial locality. Temporal locality can be explained as something that has been referenced has a high probability of being quickly referenced again (Patterson & Hennessy, 2014). While spatial locality is when instruction is referenced, instructions with addresses close to it will referenced as well (Patterson & Hennessy, 2014).

When incorporating these two concepts with referencing data, it can be explained using an array. Chi, Ho, and Lau (2012) explain that “array references have relatively strong spatial locality”. When indexing through the elements of an array is spatial locality. Elements in array hold memory addresses close to each other. Temporal locality would be constantly referencing the same element in an array.

The memory hierarchy can be broken into layers of different types of memory. The top layer is the one closest to the processor and is going to have the quickest access times. An example would be registers. The next layer would be cache, which can hold more data than a register, but the access speed is not going to be as quick. An example of the next layer would be a computer’s RAM, and after that layer a computer’s HHD or SSD would be next. As you move from the top layer to the bottom, the access speed reduces but the amount of available storage increases.

When taking memory behavior into consideration, there are two aspects that are important, coherence and consistency. Coherence “defines what values can be returned by a read” while consistency “determines when a written value will be returned by a read” (Patterson & Hennessy, 2014). Writing a program can be a complex problem. Ensuring it is reading and writing the correct instructions is crucial to a program functioning correctly.

References

Chi, C., Ho, C., & Lau, S. (2001, August 06). Reducing memory latency using a small software driven array cache. Retrieved November 29, 2021 from https://eds-s-ebscohost-com.proxy-library.ashford.edu/eds/detail/detail?vid=6&sid=b09acd0e-f245-4767-8e14-82114b8d0304%40redis&bdata=JnNpdGU9ZWRzLWxpdmUmc2NvcGU9c2l0ZQ%3d%3d#AN=edseee.375393&db=edseee

Patterson, D. A., & Hennessy, J. L. (2014). Computer organization and design: The hardware/software interface (5th ed.). Retrieved from https://zybooks.zyante.com

Comments

Peering Points and the Network Application Interface

According to Gibb (2019), “Peering is a method that allows two networks to connect and exchange traffic directly without having to pay a third party to carry traffic across the Internet.” Utilizing a peering point allows users to send a receive data directly to one another without the need to route through other computer networks. Doing so allows for a quicker, more efficient, and safer form of communication. Researching the total number of active Internet Exchange Points (IXP) proved difficult as it was hard to pinpoint an accurate number. However, according to Rosas (2021), “as of January 2021, of the 630 registered IXPs, 229 are in Europe, 126 in North America, 140 in Asia-Pacific, 96 in Latin America and the Caribbean (LAC), and 39 in Africa.” These numbers are constantly changing as new IXPs are added, and some are removed. Finding a definitive number of Internet Service Providers (ISP) globally was also difficult to accomplish. Most sources seem to point to the Nations Encyclop

VLAN Aggregation for Efficient IP Address Allocation

The project I chose to summarize on the Internet Engineering Task Force (IETF) website was RFC: 3069, VLAN Aggregation for Efficient IP Address Allocation. Within this project, the authors point out how inefficiently a Virtual Local Area Network (VLAN) allocates IP addresses along with their proposed solutions. I have also attached a diagram showing how the network would look pertaining to this project. Currently, an IP subnet would be made for each existing customer by understanding how many hosts they currently need and may need in the future. Based on that total number, the IP subnet and gateway address would change according to how many hosts the customer requested. For example, if a customer has indicated that they need ten hosts, and they only use five, the additional five that are not in use cannot be used by another customer. An illustration of this is shown below. The proposed solution to this problem is to allocate IP addresses under the same IP subnet and gateway address uti

Access Lists and Capabilities

To implement an access matrix, we must first understand what it is. An access matrix is a protection model within an operating system consisting of objects and domains. The access matrix determines which processes interact with objects within the domain. Objects within the domain can consist of both hardware and software. The lists below show the advantages and disadvantages of access lists associated with objects, and capabilities with domains. Access lists associated with objects Advantages Corresponds directly to the user’s needs. Easy revocation and review of access. Disadvantages Difficult to determine access rights for a domain. Takes time to search the domain for access rights. Capabilities with domains Advantages Useful for localizing information for a process. Secured against unauthorized access. Disadvantages Inefficient at the revocation of capabilities. Does not correspond directly to the user’s needs. Even though each implementation has its own strengths and w

An Adventure Into Technology

Search This Blog