Scribd Logo
Upload

Welcome to Scribd!

  • 20 Pthread Semphore Timing Activity

    Uploaded by

    Kiev Demidovich
    11 views7 pages
    This document discusses thread management and timing in Unix systems. It notes that adding more threads can increase management overhead and that time spent in the kernel is more deterministic than time spent elsewhere. It also discusses maintaining mutual exclusion with semaphores or other locks, issues with integer overflow for large calculations, and some ways to potentially increase program speed such as using multiple resources or tuning program size.

    Original Description:

    Original Title

    20-pthread-semphore-timing-activity

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses thread management and timing in Unix systems. It notes that adding more threads can increase management overhead and that time spent in the kernel is more deterministic than time spent elsewhere. It also discusses maintaining mutual exclusion with semaphores or other locks, issues with integer overflow for large calculations, and some ways to potentially increase program speed such as using multiple resources or tuning program size.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views7 pages

    20 Pthread Semphore Timing Activity

    Uploaded by

    Kiev Demidovich
    This document discusses thread management and timing in Unix systems. It notes that adding more threads can increase management overhead and that time spent in the kernel is more deterministic than time spent elsewhere. It also discusses maintaining mutual exclusion with semaphores or other locks, issues with integer overflow for large calculations, and some ways to potentially increase program speed such as using multiple resources or tuning program size.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Semaphores and Threads

    HW4
    More threads
    are not
    always better
    There may be an increase in
    management for new threads.
    (Same graph
    but)
    Sys/Kernel
    time
    Time spent in the kernel is
    more deterministic
    Time
    • There are three main ways of recording time in *nix systems.
    • Real time à This is the amount of time as measured by a real life clock.
    • User Time à The amount of time spent in user mode.
    • Sys Time à The amount of time spent in kernel mode.
    • Time is recorded on a per-process basis.
    • Timing is stored within the process itself.
    • When a child thread is terminated, its timing statistics are saved in
    the process structure.
    • User and Sys times are recorded across CPUs so User + Sys times may
    be > than the real time.
    Maintaining Mutual Exclusion
    • Used a (binary) semaphore
    • Other options:
    • Mutex Lock http://man7.org/linux/man-
    pages/man3/pthread_mutex_lock.3p.html
    • Spin Lock http://man7.org/linux/man-pages/man3/pthread_spin_lock.3.html
    Integer overflow
    • 160000000 * 16 is 2,560,000,000

    • Better?

    • Adding long types may be slower.


    Other ways to increase program speed
    • Use more than one resource to reduce competition.
    • Tune parameters program size.
    • If adding beyond billions reconsider atomic actions.
    • Others?

    You might also like