전체 글168 4.4 General Principles of Pipelining A key feature of pipelining is that it increases the throughput of the system (i.e., the number of customers served per unit time), but it may also slightly increase the latency (i.e., the time required to service an individual customer) ex) 단위시간당 손님들의 수가 늘어나는 반면 손님 한명당 서비스해주는데 필요한 시간은 늘어난다. 4.4.1 Computational Pipelines Combinational logic : It consists of some logic that performs a computation.. 2023. 5. 5. 4.2.5 Memory and Clocking In hardware, a register is directly connected to the rest of the circuit by its input and output wires. In machine-level programming, the registers represent a small collection of addressable words in the CPU, where the addresses consist of register IDs. A key point is that the registers serve as barriers between the combinational logic in different parts of the circuit. This register file has t.. 2023. 5. 4. 4.2.2 Combinational Circuits and HCL Boolean Expressions Upper And 는 s == 0 일때 signal b를 보낸다. Lower And 는 s == 1 일떄 signal a 를 보낸다. C논리와 HCL표현의 차이에는 몇가지 차이가 있는데 주목할만하다. C expression : 1. 프로그램이 실행하는동안에만 값이 구해진다. 2. arbitrary integers를 허용한다. 3. 부분적으로 계산이 허용된다. ex) (a && !a) && func(b,c) 부분계산으로 (a && !a) ==0 이므로 func함수 호 출이 되지않는다. HCL exprssion : 1.output이 계속 변한다 input이 변할 떄마다. 2. arbitrary integers 허용 하지 않는다. 오직 0과 1로 작동 3. 부분적인 계산이 허용되지 않는다. gate는 오직 i.. 2023. 5. 3. 4.2 Logic Design and the Hardware Control Language HCL 하드웨어 디자인에서, 전자회로는 비트로되어진 함수를 계산하거나 메모리의요소와는 다른종류로서의 비트를 저장하곤한다. 1 의미 == voltage 1.0volts 의미 0 의미 == 0.0volts 의미 4.2.1 Logic Gates 논리 회로는 digital circuits를 기본적으로 계산하는 요소이다. 위의 그림은 input a,b 둘다 비트가 1일 경우 == output 1 a,b 둘다 비트가 0일 경우 == output 1 4.2.2 Combinational Circuits and HCL Boolean Expressions Every logic gate input must be connected to exactly one of the following: (1) one of the system in.. 2023. 5. 3. 4.1 The Y86-64 Instruction Set Architecture 4.1.1 Programmer-Visible State As Figure 4.1 illustrates, each instruction in a Y86-64 program can read and modify some part of the processor state. Register %rsp is used as a stack pointer by the push, pop, call, and return instructions There are three single-bit condition codes, ZF, SF, and OF, storing information about the effect of the most recent arithmetic or logical instruction. The progr.. 2023. 5. 2. 4/29 todayWords 1. contemporary : 동시대의, 현대의 2. reciprocal : 상호간의 3. propagate : 전파하다, 번식시키다 4. 5. 6. 7. 8. 9. 2023. 4. 29. 4.4 General Principles of Pipelining 1.시스템의 처리량을 증가시킨다. ex) unit time당 customers의 수 2.하지만 이러한 증가가 잠재성(latency)을 소폭 증가시킨다 ex) 각각의 customer 가 service하는데 요구되는 시간 example) a customer in a cafeteria who only wants a dessert could pass through a nonpipelined system very quickly, stopping only at the dessert stage. A customer in a pipelined system who attempts to go directly to the dessert stage risks incurring the wrath of other customer.. 2023. 4. 29. 04/28 today_words 1. discrete : 별개의 2. throughput : 처리량 3. latency [ léitnsi ] : 잠재,잠복 4. wrath : 분노 5. Computational : 컴퓨터상의 6. combinational : 결합의 7. 8. 9. 10. 2023. 4. 28. Stack Corruption Detection there is no reliable way to prevent writing beyond the bounds of an array. Instead, the program can attempt to detect when such a write has occurred before it can have any harmful effects. Recent versions of gcc incorporate a mechanism known as a stack protector into the generated code to detect buffer overruns. The idea is to store a special canary value in the stack frame between any local buf.. 2023. 4. 28. 4.24 today words infer :추론하다, 암시하다 ex) we attempt to infer the behavior of a program by just looking at the code. scheme : 계획,제도, 생각하다, 책략을 꾸미다. ex) The general scheme is to set breakpoints near points of interest in the pro- gram. subtract : 빼다 ex) The program allocates 24 bytes on the stack by subtracting 24 from the stack pointer 2023. 4. 25. 이전 1 ··· 8 9 10 11 12 13 14 ··· 17 다음 728x90
