Vector processing example
•
0 likes•168 views
This document discusses optimizing a for loop to perform scalar versus vector processing. (a) To perform vector processing, the code is translated to use vector loads and stores with a vector length of 64 for B, C, D, and A arrays. (b) The number of cycles for scalar and vector processing is calculated based on information about the number of cycles different operations take. Scalar processing takes 1700 cycles for the full loop, while vector processing takes 17 cycles for a vector length of 64.
Report
Share
Report
Share
Download to read offline
![SCHOOL OF COMPUTER SCIENCE & ENGINEERING
Question :
Consider the following piece of code:
for (i = 0; i < 100; i ++)
A[i] = ((B[i] * C[i]) + D[i])/2;
(a) Translate the above code to perform scalar and vector processing with the vector length
of 64.
(b) Calculate the number of cycles required for scalar and vector processing by considering
the information given in the table.
Number of Cycles Description
2 Load and store instructions
4 Multiplication
4 Division
1 Addition
ANS :
Scalar Code:
Loop (1:100)
Load R1, @B-2 cycles
Load R2, @ C-2 cycles
Load R3, @ D—2 cycles
Mul R1,R2—4 cycles
Add R1,R3—1 cycle
Div R1, #2 ---4 cycles
Store R1,A—2 cycles
Total → 17 cycles * 100→ 1700 cycles
Vector Code:
Loop (1:2)
Vload V1(1:64),B(1:64) → 2 cycles
Vload V2(1:64),C(1:64) → 2 cycles
Vload V3(1:64),D(1:64) → 2 cycles
Vmul V1,V2→ 4 cycles
Vadd V1,V3→ 1 cycles](https://image.slidesharecdn.com/vectorprocessingexample-200829105334/85/Vector-processing-example-1-320.jpg)
Recommended
Knapsack Problem (DP & GREEDY)
This presentation discusses the knapsack problem and its two main versions: 0/1 and fractional. The 0/1 knapsack problem involves indivisible items that are either fully included or not included, and is solved using dynamic programming. The fractional knapsack problem allows items to be partially included, and is solved using a greedy algorithm. Examples are provided of solving each version using their respective algorithms. The time complexity of these algorithms is also presented. Real-world applications of the knapsack problem include cutting raw materials and selecting investments.
Advanced Comuter Architecture Ch6 Problem Solutions
This document contains problems and solutions related to pipelining and superscalar techniques in computer architecture. It discusses speedup factors, efficiency, throughput, and latency for a pipelined processor. It also analyzes the DEC Alpha architecture in terms of scalability and addresses a multiprocessor implementation. Several problems are solved related to reservation tables, collision vectors, state transition diagrams, and determining minimum average latency for pipeline scheduling.
Image Processing using Matlab ( using a built in Highboost filtering,averagin...
1) The document describes a student's implementation of highboost filtering in MATLAB. The student used an averaging filter to blur an image, then applied a Laplacian filter with a factor of k=3 to the blurred image, making it sharper than the original.
2) Figures 2.1 and 2.2 show the original image, blurred image, and output of applying the code to the blurred image.
3) The student tested different values of the factor k, including k=5, k=1, k=9, and k=18, and found that the best value was k=1.5.
Huffman Coding
Huffman coding is an algorithm that uses variable-length binary codes to compress data. It assigns shorter codes to more frequent symbols and longer codes to less frequent symbols. The algorithm constructs a binary tree from the frequency of symbols and extracts the Huffman codes from the tree. Huffman coding is widely used in applications like ZIP files, JPEG images, and MPEG videos to reduce file sizes for efficient transmission or storage.
Linear Block Codes
A simple parity-check code is a single-bit error-detection code where the codeword is one bit longer than the dataword. It encodes a k-bit dataword into an n-bit codeword where n=k+1. The minimum Hamming distance is 2, meaning it can detect a single bit error but cannot correct errors. It calculates the parity or XOR of the bits to generate the additional check bit and uses this to determine if an error is detected by comparing the parity of the received codeword.
Knapsack problem using greedy approach
In shared PPT we have discussed Knapsack problem using greedy approach and its two types i.e Fractional and 0-1
BCH CODE AND DECODING BCH
This document presents information on BCH codes and their decoding. It discusses how BCH codes were invented in 1959-1960 and provides an abstract stating that BCH codes form a class of cyclic error-correcting codes constructed using finite fields. Various decoding methods for BCH codes are then described, including Chien search, the Euclidean algorithm, and the Berlekamp-Massey algorithm. The document goes on to explain the general decoding process for BCH codes and provides an example. It also covers correcting errors and erasures for nonbinary BCH codes using the Euclidean algorithm, demonstrating with an example.
Lzw compression ppt
The document discusses LZW compression, an adaptive dictionary-based compression technique developed by Abraham Lempel, Jakob Ziv, and Terry Welch. It presents LZW compression's implementation, advantages like reducing file size and fast speed, and limitations like being suitable only for repetitive data. The document also describes improving LZW compression through techniques like adaptive Huffman coding and bit plane slicing, and applications of LZW compression in fields like medicine, graphics files, and hardware devices.
Recommended
Knapsack Problem (DP & GREEDY)
This presentation discusses the knapsack problem and its two main versions: 0/1 and fractional. The 0/1 knapsack problem involves indivisible items that are either fully included or not included, and is solved using dynamic programming. The fractional knapsack problem allows items to be partially included, and is solved using a greedy algorithm. Examples are provided of solving each version using their respective algorithms. The time complexity of these algorithms is also presented. Real-world applications of the knapsack problem include cutting raw materials and selecting investments.
Advanced Comuter Architecture Ch6 Problem Solutions
This document contains problems and solutions related to pipelining and superscalar techniques in computer architecture. It discusses speedup factors, efficiency, throughput, and latency for a pipelined processor. It also analyzes the DEC Alpha architecture in terms of scalability and addresses a multiprocessor implementation. Several problems are solved related to reservation tables, collision vectors, state transition diagrams, and determining minimum average latency for pipeline scheduling.
Image Processing using Matlab ( using a built in Highboost filtering,averagin...
1) The document describes a student's implementation of highboost filtering in MATLAB. The student used an averaging filter to blur an image, then applied a Laplacian filter with a factor of k=3 to the blurred image, making it sharper than the original.
2) Figures 2.1 and 2.2 show the original image, blurred image, and output of applying the code to the blurred image.
3) The student tested different values of the factor k, including k=5, k=1, k=9, and k=18, and found that the best value was k=1.5.
Huffman Coding
Huffman coding is an algorithm that uses variable-length binary codes to compress data. It assigns shorter codes to more frequent symbols and longer codes to less frequent symbols. The algorithm constructs a binary tree from the frequency of symbols and extracts the Huffman codes from the tree. Huffman coding is widely used in applications like ZIP files, JPEG images, and MPEG videos to reduce file sizes for efficient transmission or storage.
Linear Block Codes
A simple parity-check code is a single-bit error-detection code where the codeword is one bit longer than the dataword. It encodes a k-bit dataword into an n-bit codeword where n=k+1. The minimum Hamming distance is 2, meaning it can detect a single bit error but cannot correct errors. It calculates the parity or XOR of the bits to generate the additional check bit and uses this to determine if an error is detected by comparing the parity of the received codeword.
Knapsack problem using greedy approach
In shared PPT we have discussed Knapsack problem using greedy approach and its two types i.e Fractional and 0-1
BCH CODE AND DECODING BCH
This document presents information on BCH codes and their decoding. It discusses how BCH codes were invented in 1959-1960 and provides an abstract stating that BCH codes form a class of cyclic error-correcting codes constructed using finite fields. Various decoding methods for BCH codes are then described, including Chien search, the Euclidean algorithm, and the Berlekamp-Massey algorithm. The document goes on to explain the general decoding process for BCH codes and provides an example. It also covers correcting errors and erasures for nonbinary BCH codes using the Euclidean algorithm, demonstrating with an example.
Lzw compression ppt
The document discusses LZW compression, an adaptive dictionary-based compression technique developed by Abraham Lempel, Jakob Ziv, and Terry Welch. It presents LZW compression's implementation, advantages like reducing file size and fast speed, and limitations like being suitable only for repetitive data. The document also describes improving LZW compression through techniques like adaptive Huffman coding and bit plane slicing, and applications of LZW compression in fields like medicine, graphics files, and hardware devices.
13 Amortized Analysis
The amortized analysis method originally emerged as aggregated analysis (Ullmanm, Aho and Hopcroft used a version of it to analyze set representations) to analyze basic set operation in binary trees and union operations. The technique was first formally introduced by Robert Tarjan in his paper Amortized Computational Complexity. It was used to study balanced binary trees and the operation for set representations.
Travelling Salesman
The document compares and contrasts the Backtracking and Branch & Bound algorithms. Backtracking searches the entire state space tree using depth-first search until it finds a solution, while realizing when it has made an incorrect choice. Branch & Bound may search the tree using depth-first or breadth-first search, and prunes branches when it finds a better solution than exploring that branch could provide. The document also provides an example of applying the Branch & Bound algorithm to the Traveling Salesman Problem and explains how to compute the costs of nodes in this problem.
Asymptotic Notation and Complexity
The ppt will provide complete detail of different types of complexity and asymptotic notation with suitable example.
Computer graphics lab report with code in cpp
This is the lab report for computer graphics in cpp language. Basically this course is only for the computer science and engineering students.
Problem list:
1.Program for the generation of Bresenham Line Drawing.
2. Program for the generation of Digital Differential Analyzer (DDA) Line Drawing.
3. Program for the generation of Midpoint Circle Drawing.
4. Program for the generation of Midpoint Ellipse Drawing.
5. Program for the generation of Translating an object.
6. Program for the generation of Rotating an Object.
7. Program for the generation of scaling an object.
All programs are coaded in cpp language .
Cache coherence ppt
This document discusses cache coherence in single and multiprocessor systems. It provides techniques to avoid inconsistencies between cache and main memory including write-through, write-back, and instruction caching. For multiprocessors, it discusses issues with sharing writable data, process migration, and I/O activity. Software solutions involve compiler and OS management while hardware uses coherence protocols like snoopy and directory protocols.
Cost estimation for Query Optimization
The document discusses cost estimation in query optimization. It explains that the query optimizer should estimate the cost of different execution strategies and choose the strategy with the minimum estimated cost. The cost functions used are estimates and depend on factors like selectivity. The main cost components include access cost to storage, storage cost, computation cost, memory use cost, and communication cost. For different types and sizes of databases, the emphasis may be on minimizing different cost components, such as access cost for large databases. The document provides examples of cost functions for select and join operations that consider factors like index levels, block sizes, and selectivity.
digital image processing
This document discusses different types of error free compression techniques including variable-length coding, Huffman coding, and arithmetic coding. It then describes lossy compression techniques such as lossy predictive coding, delta modulation, and transform coding. Lossy compression allows for increased compression by compromising accuracy through the use of quantization. Transform coding performs four steps: decomposition, transformation, quantization, and coding to compress image data.
Basic Traversal and Search Techniques
A graph search (or traversal) technique visits every node exactly one in a systematic fashion. Two standard graph search techniques have been widely used: Depth-First Search (DFS) Breadth-First Search (BFS)
Asymptotic analysis
This document provides an introduction to asymptotic analysis of algorithms. It discusses analyzing algorithms based on how their running time increases with the size of the input problem. The key points are:
- Algorithms are compared based on their asymptotic running time as the input size increases, which is more useful than actual running times on a specific computer.
- The main types of analysis are worst-case, best-case, and average-case running times.
- Asymptotic notations like Big-O, Omega, and Theta are used to classify algorithms based on their rate of growth as the input increases.
- Common orders of growth include constant, logarithmic, linear, quadratic, and exponential time.
Asymptotic notation
This document provides an introduction to asymptotic notation, which is used to classify algorithms according to their running time or space requirements. It defines common asymptotic notations like Big-O, Big-Omega, and Big-Theta and provides examples of algorithms that run in constant time (O(1)), linear time (O(n)), logarithmic time (O(log n)), quadratic time (O(n^2)), and other runtimes. The document also compares common growth rates like constant, linear, logarithmic, n log n, quadratic, polynomial, and exponential functions. Overall, it establishes the foundation for discussing the asymptotic efficiency of algorithms.
Job sequencing with deadline
This document discusses the job sequencing problem, where the goal is to schedule jobs to be completed by their deadlines to maximize total profit. It provides an example problem with 4 jobs, their profits, deadlines, and the optimal solution of scheduling jobs J1 and J2 to earn a total profit of 140.
strassen matrix multiplication algorithm
Strassen's algorithm improves upon the standard matrix multiplication algorithm by using divide and conquer and only requiring 7 recursive multiplications to multiply 2x2 submatrices rather than 8. This results in a running time of O(n^2.81) rather than O(n^3) for large matrix sizes. The algorithm divides the matrices into submatrices, recursively multiplies the submatrices using 7 intermediate terms rather than relying on the commutativity of multiplication, and combines the results. While the improvement may seem small, the reduced exponent means Strassen's algorithm performs better than the standard algorithm for matrices larger than about 32x32 due to the impact of the exponent on runtime.
Digital clock
1. The document describes the design of a digital clock consisting of second, minute, and hour sections.
2. The second and minute sections use counter ICs to count from 00 to 59 before resetting. The hour section uses a different design to count from 00 to 11 before resetting.
3. The sections are assembled together and the completed digital clock is tested and found to operate smoothly showing the correct time.
Ellipses drawing algo.
(1) An ellipse is defined by the equation (x-h)2/a2 + (y-k)2/b2 = 1, where (h,k) is the center and a and b are the lengths of the major and minor axes.
(2) There are two methods to scan convert an ellipse - the polynomial method and trigonometric method.
(3) The midpoint ellipse algorithm uses a decision parameter p to recursively scan convert the ellipse pixel by pixel in a manner similar to the midpoint circle algorithm.
Lecture optimal binary search tree
This document discusses optimal binary search trees and provides an example problem. It begins with basic definitions of binary search trees and optimal binary search trees. It then shows an example problem with keys 1, 2, 3 and calculates the cost as 17. The document explains how to use dynamic programming to find the optimal binary search tree for keys 10, 12, 16, 21 with frequencies 4, 2, 6, 3. It provides the solution matrix and explains that the minimum cost is 2 with the optimal tree as 10, 12, 16, 21.
Traveling salesman problem(tsp)
The document discusses the travelling salesman problem (TSP). TSP involves finding the shortest possible route for a salesman to visit each city in a set and return to their starting point. The problem was first studied in the 1800s and became increasingly popular in scientific circles in the 1950s-60s. TSP is an NP-complete optimization problem with many real-world applications like delivery routing. Exact methods to solve TSP take too long, so heuristic methods provide good but not necessarily optimal solutions more quickly. The objective is to minimize the total distance traveled between cities, and TSP problems can be symmetric or asymmetric depending on whether distances between cities are the same in both directions.
Huffman Tree And Its Application
This document discusses Huffman coding, which is a technique used to compress files for transmission by assigning variable length codes to characters based on their frequency of occurrence. It provides details on how a Huffman tree is constructed by first counting character frequencies, prioritizing characters by frequency, and building the tree by combining the lowest frequency nodes. The tree is then traversed to determine the code words for each character. When encoding a file, the characters are replaced with their code words to create a more compact representation. Decoding works by using the same tree to map the code words back to characters. Huffman coding results in significant data compression by assigning shorter codes to more common characters.
Cohen Sutherland Line Clipping Algorithm Example
This document demonstrates the Cohen-Sutherland line clipping algorithm on a line segment that intersects the right and top boundaries of a clipping window. It shows the coding of the clipping codes at each endpoint and the adjustments made to the coordinates to clip the line segment within the window. The algorithm iterates, adjusting coordinates and flipping the codes until it determines the line segment is fully inside the window and can be drawn.
sum of subset problem using Backtracking
Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.
Assignment problem branch and bound.pptx
1. Branch and bound is an algorithm that uses a state space tree to solve optimization problems like the knapsack problem and traveling salesman problem. It works by recursively dividing the solution space and minimizing costs at each step.
2. The document then provides an example of using branch and bound to solve a job assignment problem with 4 jobs and 4 people. It calculates lower bounds at each step of the algorithm and prunes branches that cannot lead to an optimal solution.
3. After exploring the solution space, the algorithm arrives at the optimal assignment of Person A to Job 2, Person B to Job 1, Person C to Job 3, and Person D to Job 4, with a minimum total cost of 21.
Unit 4 dica
The document discusses combinational logic circuits. It describes combinational logic design procedures including specification, formulation, optimization, technology mapping, and verification. It also discusses analysis procedures for logic diagrams, including labeling gate outputs and determining Boolean functions. Additional topics covered include half adders, full adders, binary adders, decoders, encoders, multiplexers, priority encoders, and binary-coded decimal to seven-segment displays. Diagrams and truth tables are provided for various logic gates and circuits.
A109210503 digitallogicdesign1
This document contains questions for a digital logic design exam. It includes questions on topics like latch excitation tables, shift registers, memory decoding, logic simplification, sequential circuit design, number systems, and digital components like multiplexers, counters, and adders. Students are asked to design circuits using logic gates to implement functions, converters, comparators and other applications. They are also asked to explain concepts like synchronous/asynchronous circuits, state tables, and different types of codes.
More Related Content
What's hot
13 Amortized Analysis
The amortized analysis method originally emerged as aggregated analysis (Ullmanm, Aho and Hopcroft used a version of it to analyze set representations) to analyze basic set operation in binary trees and union operations. The technique was first formally introduced by Robert Tarjan in his paper Amortized Computational Complexity. It was used to study balanced binary trees and the operation for set representations.
Travelling Salesman
The document compares and contrasts the Backtracking and Branch & Bound algorithms. Backtracking searches the entire state space tree using depth-first search until it finds a solution, while realizing when it has made an incorrect choice. Branch & Bound may search the tree using depth-first or breadth-first search, and prunes branches when it finds a better solution than exploring that branch could provide. The document also provides an example of applying the Branch & Bound algorithm to the Traveling Salesman Problem and explains how to compute the costs of nodes in this problem.
Asymptotic Notation and Complexity
The ppt will provide complete detail of different types of complexity and asymptotic notation with suitable example.
Computer graphics lab report with code in cpp
This is the lab report for computer graphics in cpp language. Basically this course is only for the computer science and engineering students.
Problem list:
1.Program for the generation of Bresenham Line Drawing.
2. Program for the generation of Digital Differential Analyzer (DDA) Line Drawing.
3. Program for the generation of Midpoint Circle Drawing.
4. Program for the generation of Midpoint Ellipse Drawing.
5. Program for the generation of Translating an object.
6. Program for the generation of Rotating an Object.
7. Program for the generation of scaling an object.
All programs are coaded in cpp language .
Cache coherence ppt
This document discusses cache coherence in single and multiprocessor systems. It provides techniques to avoid inconsistencies between cache and main memory including write-through, write-back, and instruction caching. For multiprocessors, it discusses issues with sharing writable data, process migration, and I/O activity. Software solutions involve compiler and OS management while hardware uses coherence protocols like snoopy and directory protocols.
Cost estimation for Query Optimization
The document discusses cost estimation in query optimization. It explains that the query optimizer should estimate the cost of different execution strategies and choose the strategy with the minimum estimated cost. The cost functions used are estimates and depend on factors like selectivity. The main cost components include access cost to storage, storage cost, computation cost, memory use cost, and communication cost. For different types and sizes of databases, the emphasis may be on minimizing different cost components, such as access cost for large databases. The document provides examples of cost functions for select and join operations that consider factors like index levels, block sizes, and selectivity.
digital image processing
This document discusses different types of error free compression techniques including variable-length coding, Huffman coding, and arithmetic coding. It then describes lossy compression techniques such as lossy predictive coding, delta modulation, and transform coding. Lossy compression allows for increased compression by compromising accuracy through the use of quantization. Transform coding performs four steps: decomposition, transformation, quantization, and coding to compress image data.
Basic Traversal and Search Techniques
A graph search (or traversal) technique visits every node exactly one in a systematic fashion. Two standard graph search techniques have been widely used: Depth-First Search (DFS) Breadth-First Search (BFS)
Asymptotic analysis
This document provides an introduction to asymptotic analysis of algorithms. It discusses analyzing algorithms based on how their running time increases with the size of the input problem. The key points are:
- Algorithms are compared based on their asymptotic running time as the input size increases, which is more useful than actual running times on a specific computer.
- The main types of analysis are worst-case, best-case, and average-case running times.
- Asymptotic notations like Big-O, Omega, and Theta are used to classify algorithms based on their rate of growth as the input increases.
- Common orders of growth include constant, logarithmic, linear, quadratic, and exponential time.
Asymptotic notation
This document provides an introduction to asymptotic notation, which is used to classify algorithms according to their running time or space requirements. It defines common asymptotic notations like Big-O, Big-Omega, and Big-Theta and provides examples of algorithms that run in constant time (O(1)), linear time (O(n)), logarithmic time (O(log n)), quadratic time (O(n^2)), and other runtimes. The document also compares common growth rates like constant, linear, logarithmic, n log n, quadratic, polynomial, and exponential functions. Overall, it establishes the foundation for discussing the asymptotic efficiency of algorithms.
Job sequencing with deadline
This document discusses the job sequencing problem, where the goal is to schedule jobs to be completed by their deadlines to maximize total profit. It provides an example problem with 4 jobs, their profits, deadlines, and the optimal solution of scheduling jobs J1 and J2 to earn a total profit of 140.
strassen matrix multiplication algorithm
Strassen's algorithm improves upon the standard matrix multiplication algorithm by using divide and conquer and only requiring 7 recursive multiplications to multiply 2x2 submatrices rather than 8. This results in a running time of O(n^2.81) rather than O(n^3) for large matrix sizes. The algorithm divides the matrices into submatrices, recursively multiplies the submatrices using 7 intermediate terms rather than relying on the commutativity of multiplication, and combines the results. While the improvement may seem small, the reduced exponent means Strassen's algorithm performs better than the standard algorithm for matrices larger than about 32x32 due to the impact of the exponent on runtime.
Digital clock
1. The document describes the design of a digital clock consisting of second, minute, and hour sections.
2. The second and minute sections use counter ICs to count from 00 to 59 before resetting. The hour section uses a different design to count from 00 to 11 before resetting.
3. The sections are assembled together and the completed digital clock is tested and found to operate smoothly showing the correct time.
Ellipses drawing algo.
(1) An ellipse is defined by the equation (x-h)2/a2 + (y-k)2/b2 = 1, where (h,k) is the center and a and b are the lengths of the major and minor axes.
(2) There are two methods to scan convert an ellipse - the polynomial method and trigonometric method.
(3) The midpoint ellipse algorithm uses a decision parameter p to recursively scan convert the ellipse pixel by pixel in a manner similar to the midpoint circle algorithm.
Lecture optimal binary search tree
This document discusses optimal binary search trees and provides an example problem. It begins with basic definitions of binary search trees and optimal binary search trees. It then shows an example problem with keys 1, 2, 3 and calculates the cost as 17. The document explains how to use dynamic programming to find the optimal binary search tree for keys 10, 12, 16, 21 with frequencies 4, 2, 6, 3. It provides the solution matrix and explains that the minimum cost is 2 with the optimal tree as 10, 12, 16, 21.
Traveling salesman problem(tsp)
The document discusses the travelling salesman problem (TSP). TSP involves finding the shortest possible route for a salesman to visit each city in a set and return to their starting point. The problem was first studied in the 1800s and became increasingly popular in scientific circles in the 1950s-60s. TSP is an NP-complete optimization problem with many real-world applications like delivery routing. Exact methods to solve TSP take too long, so heuristic methods provide good but not necessarily optimal solutions more quickly. The objective is to minimize the total distance traveled between cities, and TSP problems can be symmetric or asymmetric depending on whether distances between cities are the same in both directions.
Huffman Tree And Its Application
This document discusses Huffman coding, which is a technique used to compress files for transmission by assigning variable length codes to characters based on their frequency of occurrence. It provides details on how a Huffman tree is constructed by first counting character frequencies, prioritizing characters by frequency, and building the tree by combining the lowest frequency nodes. The tree is then traversed to determine the code words for each character. When encoding a file, the characters are replaced with their code words to create a more compact representation. Decoding works by using the same tree to map the code words back to characters. Huffman coding results in significant data compression by assigning shorter codes to more common characters.
Cohen Sutherland Line Clipping Algorithm Example
This document demonstrates the Cohen-Sutherland line clipping algorithm on a line segment that intersects the right and top boundaries of a clipping window. It shows the coding of the clipping codes at each endpoint and the adjustments made to the coordinates to clip the line segment within the window. The algorithm iterates, adjusting coordinates and flipping the codes until it determines the line segment is fully inside the window and can be drawn.
sum of subset problem using Backtracking
Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.
Assignment problem branch and bound.pptx
1. Branch and bound is an algorithm that uses a state space tree to solve optimization problems like the knapsack problem and traveling salesman problem. It works by recursively dividing the solution space and minimizing costs at each step.
2. The document then provides an example of using branch and bound to solve a job assignment problem with 4 jobs and 4 people. It calculates lower bounds at each step of the algorithm and prunes branches that cannot lead to an optimal solution.
3. After exploring the solution space, the algorithm arrives at the optimal assignment of Person A to Job 2, Person B to Job 1, Person C to Job 3, and Person D to Job 4, with a minimum total cost of 21.
What's hot (20)
Similar to Vector processing example
Unit 4 dica
The document discusses combinational logic circuits. It describes combinational logic design procedures including specification, formulation, optimization, technology mapping, and verification. It also discusses analysis procedures for logic diagrams, including labeling gate outputs and determining Boolean functions. Additional topics covered include half adders, full adders, binary adders, decoders, encoders, multiplexers, priority encoders, and binary-coded decimal to seven-segment displays. Diagrams and truth tables are provided for various logic gates and circuits.
A109210503 digitallogicdesign1
This document contains questions for a digital logic design exam. It includes questions on topics like latch excitation tables, shift registers, memory decoding, logic simplification, sequential circuit design, number systems, and digital components like multiplexers, counters, and adders. Students are asked to design circuits using logic gates to implement functions, converters, comparators and other applications. They are also asked to explain concepts like synchronous/asynchronous circuits, state tables, and different types of codes.
Digital logic design1
Download More Jntu Question Papers here http://www.jntu-world.com/p/jntu-previous-question-papers.html
Understand data representation on CPU 1
This document discusses data representation on a CPU, including numbering systems such as decimal, binary, octal, and hexadecimal. It covers converting between these numbering systems, binary arithmetic, ones' complement, twos' complement, signed numbers, coding systems such as ASCII, and digital logic components. The document provides examples of performing arithmetic in different numbering systems and converting between binary, decimal, octal, and hexadecimal.
SOLUTION MANUAL OF COMPUTER ORGANIZATION BY CARL HAMACHER, ZVONKO VRANESIC & ...
1) The document provides solutions to problems from Chapter 1 and Chapter 2 of a computer organization textbook.
2) In Chapter 1, it discusses basic computer structure, performance improvement through overlapping operations, and performance comparisons between RISC and CISC processors. In Chapter 2, it covers machine instructions, binary representations of numbers, assembly language programming, and addressing modes.
3) Some of the problems solved include calculating non-overlapped and overlapped execution times, comparing RISC and CISC processors under different clock rates, implementing addition and subtraction in binary, writing assembly code to calculate a dot product, and designing programs that use indexed addressing modes.
RC6
The document describes RC6, a block cipher proposed as a candidate for the Advanced Encryption Standard (AES). RC6 is based on RC5 but adapted to meet AES requirements. It operates on 128-bit blocks using a variable number of rounds, rotations, XORs and additions modulated by a key-dependent S-box. Implementation results show RC6 encrypting/decrypting over 100 megabits/second on modern processors. Security analysis finds no known practical attacks against RC6 even with a reduced number of rounds. The designers conclude RC6 meets AES requirements by being simple, fast and secure.
Design of QSD Number System Addition using Delayed Addition Technique
Abstract: Quaternary number system is a base-4 numeral system. Using Quaternary Signed Digit (QSD) number system may also execute carry free addition, borrow free subtraction and multiplication. The QSD number system wants a different group of prime modulo based logic elements for each arithmetic operation. In this work we extend this QSD addition to Delayed addition in place of carry free addition. Carry free addition generates intermediate carry and intermediate sum, in this carry propagation is required to generate intermediate sum. To reduce carry propagation we evaluated delayed addition. This delayed addition reduces carry propagation and improves arithmetic calculations. We present both QSD and Floating –point single precision addition using delayed addition. The design work is carried by using Verilog HDL in ISE.
Keywords: QSD, DA, CFA and Floating-Point.
Design of QSD Number System Addition using Delayed Addition Technique
Abstract: Quaternary number system is a base-4 numeral system. Using Quaternary Signed Digit (QSD) number system may also execute carry free addition, borrow free subtraction and multiplication. The QSD number system wants a different group of prime modulo based logic elements for each arithmetic operation. In this work we extend this QSD addition to Delayed addition in place of carry free addition. Carry free addition generates intermediate carry and intermediate sum, in this carry propagation is required to generate intermediate sum. To reduce carry propagation we evaluated delayed addition. This delayed addition reduces carry propagation and improves arithmetic calculations. We present both QSD and Floating –point single precision addition using delayed addition. The design work is carried by using Verilog HDL in ISE.
Keywords: QSD, DA, CFA and Floating-Point.
Comparison among Different Adders
IOSR journal of VLSI and Signal Processing (IOSRJVSP) is a double blind peer reviewed International Journal that publishes articles which contribute new results in all areas of VLSI Design & Signal Processing. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced VLSI Design & Signal Processing concepts and establishing new collaborations in these areas.
Design and realization of microelectronic systems using VLSI/ULSI technologies require close collaboration among scientists and engineers in the fields of systems architecture, logic and circuit design, chips and wafer fabrication, packaging, testing and systems applications. Generation of specifications, design and verification must be performed at all abstraction levels, including the system, register-transfer, logic, circuit, transistor and process levels
Circular convolution Using DFT Matlab Code
This document describes an experiment in digital signal processing involving linear and circular convolution using discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) techniques. The experiment uses MATLAB to compute the convolution of sample input signals x and h in both the linear and circular cases. Output results are displayed showing the convolution outputs match those obtained using built-in MATLAB convolution functions. The document provides code examples and output plots to demonstrate linear and circular convolution computation in the frequency domain.
Combinational circuit
The document discusses combinational logic circuits. It covers sum-of-products and product-of-sums forms for representing logic functions. Methods for analyzing and simplifying logic circuits are presented, including Boolean algebra, Karnaugh maps, and deriving truth tables from logic diagrams. Examples of common logic circuits like adders, decoders, and converters are provided along with steps for designing combinational logic circuits.
Module 4
This document outlines the key topics covered in Chapter 1 of a course on digital systems and computer design fundamentals. It includes:
- An introduction to digital systems and information representation.
- Details on number systems like binary, octal, and hexadecimal, along with arithmetic operations and base conversion between these systems.
- Overviews of topics like binary coded decimal, Gray codes, alphanumeric codes, and parity bits.
- Explanations of binary addition, subtraction, multiplication, and the conversion between decimal and binary numbers.
- Information on the course instructor, textbook, grading policy, exam dates, and course content which includes topics on combinational logic circuits, sequential circuits, and computer architecture.
Objective Questions Digital Electronics
This document contains a collection of multiple choice questions related to digital electronics circuits. It includes questions about topics like logic expressions, logic gates, flip-flops, counters, analog-to-digital converters, and more. The questions are part of an exam and range in difficulty.
Ecad &vlsi lab 18
This document contains the laboratory manual for the ECAD & VLSI Design course for the 4th semester ECE students of Malla Reddy College of Engineering and Technology. It includes 15 experiments on digital circuit design using Verilog HDL. The experiments cover designing basic digital components like full adder, ripple carry adder, carry save adder, carry select adder, BCD adder, multiplexer, array multiplier, counters, ring counter, PRBS generator, accumulator. It also includes designing basic CMOS logic gates like inverter, NAND, NOR, XOR gates and a 1-bit CMOS full adder. The last two experiments are on CMOS common source amplifier and differential amplifier.
5. Arithmaticn combinational Ckt.ppt
A combinational circuit consists of logic gates whose outputs are determined solely by the present inputs. A combinational logic circuit has no feedback or memory. The document discusses various types of combinational logic circuits including adders, subtractors, multipliers and their analysis and design procedures. It provides examples of half adders, full adders, binary adders and subtractors as well as methods for designing multipliers using truth tables and arrays of adders.
Engineering Fast Indexes for Big-Data Applications: Spark Summit East talk by...
Contemporary computing hardware offers massive new performance opportunities. Yet high-performance programming remains a daunting challenge.
We present some of the lessons learned while designing faster indexes, with a particular emphasis on compressed bitmap indexes. Compressed bitmap indexes accelerate queries in popular systems such as Apache Spark, Git, Elastic, Druid and Apache Kylin.
Engineering fast indexes (Deepdive)
Contemporary computing hardware offers massive new performance opportunities. Yet high-performance programming remains a daunting challenge.
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
Winter ’18 CIS 314 Final A Name: SID:
1. [5] Draw a 2-input XOR circuit using only AND, OR, and NOT gates:
2. [15] Describe the functionality of each Y86 pipeline stage during execution of the
andl rA, rB instruction in terms of the icode, ifun, rA, rB, valA, valB, valC, valP,
valE, valM, srcA, srcB, dstE, dstM, cnd signals (you may also use M, R, and PC):
IF:
ID:
EX:
MEM:
WB+PC:
3. [5] Briefly describe why the stall penalty for a pipelined Y86 ret instruction is 3
cycles:
4. [15] Consider the following C procedure:
void swap(int *xp, int *yp) {
int t0 = *xp;
int t1 = *yp;
*xp = t1;
*yp = t0;
}
Write Y86 code that implements the above C procedure. Comment your code:
5. [15] Consider the following C function:
int f(int *a, int *dest, int prod) {
*dest = prod ? 1 : 0;
for (int i = 0; i < len(a); ++i) {
if (prod) {
*dest *= a[i];
} else {
*dest += a[i];
}
}
}
Rewrite the above C function to minimize unnecessary function calls, memory
writes, and if statements:
6. [20] Consider the following Y86 code:
mrmovl 0(%eax) %ecx
mrmovl 0(%ebx) %edx
addl %ecx %ecx
xorl %ecx %edx
a. (10) How many pipeline stalls are required when running the above code without
data forwarding? Why? Draw a pipeline diagram to support your answer:
b. (10) How many pipeline stalls are required when running the above code with
data forwarding? Why? Draw a pipeline diagram to support your answer:
7. (25) Consider a 32-byte direct-mapped cache with 8-byte blocks for an 8-bit
machine (256 bytes of memory):
a. (5) Write a C function unsigned char getOffset(unsigned char address) that
returns the cache offset for the specified address using bitwise operators (assuming
the cache parameters above):
b. (5) Write a C function unsigned char getSet(unsigned char address) that returns
the cache set for the specified address using bitwise operators (assuming the cache
parameters above):
c. (15) If the following addresses are accessed in sequence, which addresses will
result in cache hits and which will result in misses (assuming the cache parameters
above and that the cache is initially empty)? For each address, show the tag, set,
offset, and whether it resulted in hit or miss:
0x02
0x04
0x8
0x26
0x04
0x24
.
International Journal of Engineering Research and Development (IJERD)
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
microprocessors
The document provides an overview of microprocessors and microcontrollers. It discusses the history and evolution of microprocessors from early minicomputers in the 1960s to modern microcontrollers that integrate CPU, memory and I/O onto a single chip. The document outlines common microprocessor components like registers, ALU, buses and control units. It also covers digital logic gates, memory systems, number representations and instruction sets.
Similar to Vector processing example (20)
SOLUTION MANUAL OF COMPUTER ORGANIZATION BY CARL HAMACHER, ZVONKO VRANESIC & ...
SOLUTION MANUAL OF COMPUTER ORGANIZATION BY CARL HAMACHER, ZVONKO VRANESIC & ...
Design of QSD Number System Addition using Delayed Addition Technique
Design of QSD Number System Addition using Delayed Addition Technique
Design of QSD Number System Addition using Delayed Addition Technique
Design of QSD Number System Addition using Delayed Addition Technique
Engineering Fast Indexes for Big-Data Applications: Spark Summit East talk by...
Engineering Fast Indexes for Big-Data Applications: Spark Summit East talk by...
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
Winter ’18 CIS 314 Final A Name SID 1. [5] Draw a .docx
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
Recently uploaded
官方认证美国密歇根州立大学毕业证学位证书原版一模一样
原版一模一样【微信：741003700 】【美国密歇根州立大学毕业证学位证书】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
一比一原版(CalArts毕业证)加利福尼亚艺术学院毕业证如何办理
CalArts毕业证学历书【微信95270640】CalArts毕业证’圣力嘉学院毕业证《Q微信95270640》办理CalArts毕业证√文凭学历制作{CalArts文凭}购买学历学位证书本科硕士,CalArts毕业证学历学位证【实体公司】办毕业证、成绩单、学历认证、学位证、文凭认证、办留信网认证、（网上可查，实体公司，专业可靠）
(诚招代理)办理国外高校毕业证成绩单文凭学位证,真实使馆公证（留学回国人员证明）真实留信网认证国外学历学位认证雅思代考国外学校代申请名校保录开请假条改GPA改成绩ID卡
1.高仿业务:【本科硕士】毕业证,成绩单（GPA修改）,学历认证（教育部认证）,大学Offer,,ID,留信认证,使馆认证,雅思,语言证书等高仿类证书；
2.认证服务: 学历认证（教育部认证）,大使馆认证（回国人员证明）,留信认证（可查有编号证书）,大学保录取,雅思保分成绩单。
3.技术服务：钢印水印烫金激光防伪凹凸版设计印刷激凸温感光标底纹镭射速度快。
办理加利福尼亚艺术学院加利福尼亚艺术学院毕业证文凭证书流程：
1客户提供办理信息：姓名生日专业学位毕业时间等（如信息不确定可以咨询顾问：我们有专业老师帮你查询）；
2开始安排制作毕业证成绩单电子图；
3毕业证成绩单电子版做好以后发送给您确认；
4毕业证成绩单电子版您确认信息无误之后安排制作成品；
5成品做好拍照或者视频给您确认；
6快递给客户（国内顺丰国外DHLUPS等快读邮寄）
-办理真实使馆公证（即留学回国人员证明）
-办理各国各大学文凭（世界名校一对一专业服务,可全程监控跟踪进度）
-全套服务：毕业证成绩单真实使馆公证真实教育部认证。让您回国发展信心十足！
（详情请加一下 文凭顾问+微信:95270640）欢迎咨询！子小伍玩小伍比山娃小一岁虎头虎脑的很霸气父亲让山娃跟小伍去夏令营听课山娃很高兴夏令营就设在附近一所小学山娃发现那所小学比自己的学校更大更美操场上还铺有塑胶跑道呢里面很多小朋友一班一班的快快乐乐原来城里娃都藏这儿来了怪不得平时见不到他们山娃恍然大悟起来吹拉弹唱琴棋书画山娃都不懂却什么都想学山娃怨自己太笨什么都不会斟酌再三山娃终于选定了学美术当听说每月要交元时父亲犹豫了山娃也说爸算了吧咱学校一学期才转
22CYT12-Unit-V-E Waste and its Management.ppt
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Null Bangalore | Pentesters Approach to AWS IAM
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
artificial intelligence and data science contents.pptx
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
cnn.pptx Convolutional neural network used for image classication
Convolutional Neural Network used for image classification
Recently uploaded (20)
Generative AI leverages algorithms to create various forms of content
Generative AI leverages algorithms to create various forms of content
Data Control Language.pptx Data Control Language.pptx
Data Control Language.pptx Data Control Language.pptx
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
2008 BUILDING CONSTRUCTION Illustrated - Ching Chapter 02 The Building.pdf
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
artificial intelligence and data science contents.pptx
artificial intelligence and data science contents.pptx
cnn.pptx Convolutional neural network used for image classication
cnn.pptx Convolutional neural network used for image classication
Vector processing example
- 1. SCHOOL OF COMPUTER SCIENCE & ENGINEERING Question : Consider the following piece of code: for (i = 0; i < 100; i ++) A[i] = ((B[i] * C[i]) + D[i])/2; (a) Translate the above code to perform scalar and vector processing with the vector length of 64. (b) Calculate the number of cycles required for scalar and vector processing by considering the information given in the table. Number of Cycles Description 2 Load and store instructions 4 Multiplication 4 Division 1 Addition ANS : Scalar Code: Loop (1:100) Load R1, @B-2 cycles Load R2, @ C-2 cycles Load R3, @ D—2 cycles Mul R1,R2—4 cycles Add R1,R3—1 cycle Div R1, #2 ---4 cycles Store R1,A—2 cycles Total → 17 cycles * 100→ 1700 cycles Vector Code: Loop (1:2) Vload V1(1:64),B(1:64) → 2 cycles Vload V2(1:64),C(1:64) → 2 cycles Vload V3(1:64),D(1:64) → 2 cycles Vmul V1,V2→ 4 cycles Vadd V1,V3→ 1 cycles
- 2. Vdiv V1,2 → 4 cycles Vstore V1,A→ 2 cycles Total 17 *2 =34 cycles ( 32 vector size ) For 64 , 17 cycles