ALU R-Type Functions

The R-type or R-format instructions read two registers: rs-first register source operand and rt second register source operand. It then moves onto the written instruction (rd) which is the register destination operand. To support the instructions, we need to add an element called the register file. Doing so will both read and write starting with Read Register 1, which is the first source register, and will be 5 bits long. Next is the Read Register 2 which is the second source register and is also 5 bits wide. Then we move onto the write register which is the destination register and will be 5 bits wide as well. Last is the write data which is data waiting to be written to the register and it is 32 bits wide. Keeping that in mind, “To actually execute R-format instructions, we need to include the ALU element. The ALU performs the operation indicated by the instruction. It takes two operands, as well as a 4-bit wide operation selector value. The result of the operation is the output value. ALU operation is a part of the control” (Wang, 2017). The memory instructions implement the functionality for both reading and writing data to and from the memory. There are also two inputs to the memory instructions: One for the address and the other for the data to be written to memory. These are signaled by commands like MemRead and MemWrite which must be asserted for the correct action to take place in reaching the desired outcome.

References

Wang, Z. (2017). Lecture 5: Single-Cycle Datapath and Control. Florida State University. http://www.cs.fsu.edu/~zwang/files/cda3101/Fall2017/Lecture5_cda3101.pdf

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