Scribd Logo
Upload

Welcome to Scribd!

  • 95 views

    Bit-Level Parallelism

    Uploaded by

    SHAMEEK PATHAK
    Bit-level parallelism is a form of parallel computing that reduces the number of instructions needed to perform tasks on large data by increasing the processor's size. For example, an 8-bit processor would need two instructions to sum two 16-bit integers, while a 16-bit processor could do it in one instruction. Serial computing executes instructions one at a time on a single processor core, while parallel computing breaks problems into pieces that can be solved simultaneously across multiple processor cores to reduce computation time. The advantages of parallel computing include saving time and money by distributing work across resources, and better utilizing available hardware.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Bit-Level Parallelism

    Uploaded by

    SHAMEEK PATHAK
    95 views3 pages
    Bit-level parallelism is a form of parallel computing that reduces the number of instructions needed to perform tasks on large data by increasing the processor's size. For example, an 8-bit processor would need two instructions to sum two 16-bit integers, while a 16-bit processor could do it in one instruction. Serial computing executes instructions one at a time on a single processor core, while parallel computing breaks problems into pieces that can be solved simultaneously across multiple processor cores to reduce computation time. The advantages of parallel computing include saving time and money by distributing work across resources, and better utilizing available hardware.

    Original Title

    bit-level parallelism

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Bit-level parallelism is a form of parallel computing that reduces the number of instructions needed to perform tasks on large data by increasing the processor's size. For example, an 8-bit processor would need two instructions to sum two 16-bit integers, while a 16-bit processor could do it in one instruction. Serial computing executes instructions one at a time on a single processor core, while parallel computing breaks problems into pieces that can be solved simultaneously across multiple processor cores to reduce computation time. The advantages of parallel computing include saving time and money by distributing work across resources, and better utilizing available hardware.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    95 views3 pages

    Bit-Level Parallelism

    Uploaded by

    SHAMEEK PATHAK
    Bit-level parallelism is a form of parallel computing that reduces the number of instructions needed to perform tasks on large data by increasing the processor's size. For example, an 8-bit processor would need two instructions to sum two 16-bit integers, while a 16-bit processor could do it in one instruction. Serial computing executes instructions one at a time on a single processor core, while parallel computing breaks problems into pieces that can be solved simultaneously across multiple processor cores to reduce computation time. The advantages of parallel computing include saving time and money by distributing work across resources, and better utilizing available hardware.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Bit-Level Parallelism

    Computer software was written conventionally for serial computing. This meant
    that to solve a problem, an algorithm divides the problem into smaller instructions.
    These discrete instructions are then executed on the Central Processing Unit of
    a computer one by one. Only after one instruction is finished, next one starts.
    A real-life example of this would be people standing in a queue waiting for a
    movie ticket and there is only a cashier. The cashier is giving tickets one by one
    to the persons. The complexity of this situation increases when there are 2
    queues and only one cashier.
    So, in short, Serial Computing is following:
    1. In this, a problem statement is broken into discrete instructions.
    2. Then the instructions are executed one by one.
    3. Only one instruction is executed at any moment of time.

    Look at point 3. This was causing a huge problem in the computing industry as
    only one instruction was getting executed at any moment of time. This was a
    huge waste of hardware resources as only one part of the hardware will be
    running for particular instruction and of time. As problem statements were getting
    heavier and bulkier, so does the amount of time in execution of those statements.
    Examples of processors are Pentium 3 and Pentium 4.
    Now let’s come back to our real-life problem. We could definitely say that
    complexity will decrease when there are 2 queues and 2 cashiers giving tickets
    to 2 persons simultaneously. This is an example of Parallel Computing.
    Parallel Computing :
    It is the use of multiple processing elements simultaneously for solving any
    problem. Problems are broken down into instructions and are solved concurrently
    as each resource that has been applied to work is working at the same time.

    Advantages of Parallel Computing over Serial Computing are as follows:


    1. It saves time and money as many resources working together will
    reduce the time and cut potential costs.
    2. It can be impractical to solve larger problems on Serial Computing.
    3. It can take advantage of non-local resources when the local resources
    are finite.
    4. Serial Computing ‘wastes’ the potential computing power, thus Parallel
    Computing makes better work of the hardware.

    Types of Parallelism:
    1. Bit-level parallelism –
    It is the form of parallel computing which is based on the increasing
    processor’s size. It reduces the number of instructions that the system
    must execute in order to perform a task on large-sized data.
    Example: Consider a scenario where an 8-bit processor must compute
    the sum of two 16-bit integers. It must first sum up the 8 lower-order
    bits, then add the 8 higher-order bits, thus requiring two instructions to
    perform the operation. A 16-bit processor can perform the operation
    with just one instruction.
    2. Instruction-level parallelism –
    A processor can only address less than one instruction for each clock
    cycle phase. These instructions can be re-ordered and grouped which
    are later on executed concurrently without affecting the result of the
    program. This is called instruction-level parallelism.
    3. Task Parallelism –
    Task parallelism employs the decomposition of a task into subtasks and
    then allocating each of the subtasks for execution. The processors
    perform the execution of sub-tasks concurrently.
    4. Data-level parallelism (DLP) –
    Instructions from a single stream operate concurrently on several data
    – Limited by non-regular data manipulation patterns and by memory
    bandwidth

    Why parallel computing?


    • The whole real-world runs in dynamic nature i.e. many things happen at
    a certain time but at different places concurrently. This data is
    extensively huge to manage.
    • Real-world data needs more dynamic simulation and modeling, and for
    achieving the same, parallel computing is the key.
    • Parallel computing provides concurrency and saves time and money.
    • Complex, large datasets, and their management can be organized only
    and only using parallel computing’s approach.
    • Ensures the effective utilization of the resources. The hardware is
    guaranteed to be used effectively whereas in serial computation only
    some part of the hardware was used and the rest rendered idle.
    • Also, it is impractical to implement real-time systems using serial
    computing.

    Applications of Parallel Computing:


    • Databases and Data mining.
    • Real-time simulation of systems.
    • Science and Engineering.
    • Advanced graphics, augmented reality, and virtual reality.
    Limitations of Parallel Computing:
    • It addresses such as communication and synchronization between
    multiple sub-tasks and processes which is difficult to achieve.
    • The algorithms must be managed in such a way that they can be
    handled in a parallel mechanism.
    • The algorithms or programs must have low coupling and high cohesion.
    But it’s difficult to create such programs.
    • More technically skilled and expert programmers can code a
    parallelism-based program well.

    Future of Parallel Computing: The computational graph has undergone a great


    transition from serial computing to parallel computing. Tech giant such as Intel
    has already taken a step towards parallel computing by employing multicore
    processors. Parallel computation will revolutionize the way computers work in the
    future, for the better good. With all the world connecting to each other even more
    than before, Parallel Computing does a better role in helping us stay that way.
    With faster networks, distributed systems, and multi-processor computers, it
    becomes even more necessary.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy