Skip to main content


Showing posts from February 14, 2021

Featured Post

The Economics of Autonomy

In ancient legend, there is a Creation story: in contemporary times, it is known as the first book of Moses called the book of Genesis. When God IS creating the world, Genesis (KJV) states, “And God said, Let there be light: and there was light” (Genesis 1:3). According to legend, the 1st great Prophet, named Isaiah, told his faith to his friends, his people, and his enemies. Isaiah wrote, “Behold, God is my salvation; I will trust, and not be afraid: for the LORD JEHOVAH is my strength and my song; he also is become my salvation” (Isaiah 12:2) A man called the Christ was crucified, then according to Roman Empire record, died, but according to Christian legend, rose again. In Christian tradition, Jesus the Christ stated Christians should conclude our prayers to God, our Father, this way: “And lead us not into temptation, but deliver us from evil: For thine is the kingdom, and the power, and the glory, for ever. Amen” (Matthew 6:13). Following Jesus of Nazareth, a New Testament writer,

On Datapaths: Accepting, but Surpassing Limits

In Computer Organization and Design MIPS Edition, authors, David A. Patterson and John L. Hennessy wrote a piece of information: they defined single-cycle implementation. On single-cycle implementation, Patterson and Hennessy wrote, “Also called single clock cycle implementation. An implementation in which an instruction is executed in one clock cycle. While easy to understand, it is too slow to be practical” (Patterson & Hennessy 2014). Patterson and Hennessy were saying this: for every instruction, an instruction requires one clock cycle. As this is a scalability issue, increasing the instructions to two: requires two clock cycles. Against the pseudo-infinity within, I shall describe, common case hardware, von Neumann computers: this requires a series because this shall make calculation sufficiently easier than a sequence that has no calculation. The series is this: from 0 instructions to n instructions, the series X is incremented one instruction divided the equivalent clock cyc

Data Pipelines and Data Distribution

As the C programming distributive library, MPI (Message Passing Interface), encourages simultaneous application process task because it is efficient enough, our MIPS 5-stage pipeline system allows simultaneous instruction execution. The potential benefit of applying the principles is the sufficient reduction in program execution time. As a major effect, data hazards can occur: when a pipeline changes its read/write accessibility order because the order differ, sequentially; but specifically, on the unpipelined machine, seen regarding sequentially executing instructions[1,2] . Called a data stall because a stall degrades the ideal program performance, the ideal CPI and pipeline stalled-clock cycles per instruction results in a greater than 1 CPI pipelined CPI. For maintaining accurate overhead, cycle time overhead should not be ignored, so pipelining is accurately calculated, but the result will not be an intuitive one. Thankfully, data forwarding can solve data hazards because forwardi

Contact Form


Email *

Message *