Operating Systems Process Scheduling Algorithmssathish sak
CPU scheduling big area of research in early ‘70s
Many implicit assumptions for CPU scheduling:
One program per user
One thread per program
Programs are independent
These are unrealistic but simplify the problem
Does “fair” mean fairness among users or programs?
If I run one compilation job and you run five, do you get five times as much CPU?
Often times, yes!
Goal: dole out CPU time to optimize some desired parameters of the system.
Operating Systems Process Scheduling Algorithmssathish sak
CPU scheduling big area of research in early ‘70s
Many implicit assumptions for CPU scheduling:
One program per user
One thread per program
Programs are independent
These are unrealistic but simplify the problem
Does “fair” mean fairness among users or programs?
If I run one compilation job and you run five, do you get five times as much CPU?
Often times, yes!
Goal: dole out CPU time to optimize some desired parameters of the system.
This presentation talks about Real Time Operating Systems (RTOS). Starting with fundamental concepts of OS, this presentation deep dives into Embedded, Real Time and related aspects of an OS. Appropriate examples are referred with Linux as a case-study. Ideal for a beginner to build understanding about RTOS.
Gives an overview about Process, PCB, Process States, Process Operations, Scheduling, Schedulers, Interprocess communication, shared memory and message passing systems
In this presentation, I am explaining about Threads, types of threads, its advantages and disadvantages, difference between Process and Threads, multithreading and its type.
"Like the ppt if you liked the ppt"
LinkedIn - https://in.linkedin.com/in/prakharmaurya
Operating system 24 mutex locks and semaphoresVaibhav Khanna
Mutual Exclusion - If process Pi is executing in its critical section, then no other processes can be executing in their critical sections
2. Progress - If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely
3. Bounded Waiting - A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted
Assume that each process executes at a nonzero speed
No assumption concerning relative speed of the n processes
A brief introduction to Process synchronization in Operating Systems with classical examples and solutions using semaphores. A good starting tutorial for beginners.
The heavyweight "process model", historically used by Unix systems, including Linux, to split a large system into smaller, more tractable pieces doesn’t always lend itself to embedded environments
owing to substantial computational overhead. POSIX threads, also known as Pthreads, is a multithreading API that looks more like what embedded programmers are used to but runs in a
Unix/Linux environment. This presentation introduces Posix Threads and shows you how to use threads to create more efficient, more responsive programs.
This presentation talks about Real Time Operating Systems (RTOS). Starting with fundamental concepts of OS, this presentation deep dives into Embedded, Real Time and related aspects of an OS. Appropriate examples are referred with Linux as a case-study. Ideal for a beginner to build understanding about RTOS.
Gives an overview about Process, PCB, Process States, Process Operations, Scheduling, Schedulers, Interprocess communication, shared memory and message passing systems
In this presentation, I am explaining about Threads, types of threads, its advantages and disadvantages, difference between Process and Threads, multithreading and its type.
"Like the ppt if you liked the ppt"
LinkedIn - https://in.linkedin.com/in/prakharmaurya
Operating system 24 mutex locks and semaphoresVaibhav Khanna
Mutual Exclusion - If process Pi is executing in its critical section, then no other processes can be executing in their critical sections
2. Progress - If no process is executing in its critical section and there exist some processes that wish to enter their critical section, then the selection of the processes that will enter the critical section next cannot be postponed indefinitely
3. Bounded Waiting - A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its critical section and before that request is granted
Assume that each process executes at a nonzero speed
No assumption concerning relative speed of the n processes
A brief introduction to Process synchronization in Operating Systems with classical examples and solutions using semaphores. A good starting tutorial for beginners.
The heavyweight "process model", historically used by Unix systems, including Linux, to split a large system into smaller, more tractable pieces doesn’t always lend itself to embedded environments
owing to substantial computational overhead. POSIX threads, also known as Pthreads, is a multithreading API that looks more like what embedded programmers are used to but runs in a
Unix/Linux environment. This presentation introduces Posix Threads and shows you how to use threads to create more efficient, more responsive programs.
For Complete Learning: http://www.thelearnet.com/
Overview
Multithreading Models
Threading Issues
Pthreads
Solaris 2 Threads
Windows 2000 Threads
Linux Threads
Java Threads
Confronting the Future--Strategic Visions for the 21st Century Public LibraryMarc Gartler
Selected slides from my 7/28/11 presentation to SCLS library directors: Confronting the Future--Strategic Visions for the 21st Century Public Library (on OITP policy brief #4, of the same name)
Staff study talk/ on search engine & internet in 2008Sujit Chandak
It was in the Year 2008, when many in our staff did not in detail know as to how a internet search works, although everybody knew and used internet. A very basic session i took and which was very interesting for the senior faculties...they wanted to know the most...
It has thread dumps to be referred from another presentation titled 'Debugging performance bottlenecks in java enterprise application' at http://www.slideshare.net/AjitBhingarkar/debugging-performance-bottlenecks-in-java-enterprise-application-42246703.
Most modern applications are multithreaded
Threads run within application
Multiple tasks with the application can be implemented by separate threads
Update display
Fetch data
Spell checking
Answer a network request
Process creation is heavy-weight while thread creation is light-weight
Can simplify code, increase efficiency
Kernels are generally multithreaded
The objectives of Multithreaded programming in Operating systems are:
- To introduce the notion of a thread—a fundamental unit of CPU utilization that forms the basis of multithreaded computer systems.
- To discuss the APIs for the Pthreads, Windows, and Java thread libraries
- To explore several strategies that provide implicit threading.
- To examine issues related to multithreaded programming.
- To cover operating system support for threads in Windows and Linux.
For over 40 years, virtually all computers have followed a common machine model known as the von Neumann computer. Name after the Hungarian mathématicien John von Neumann.
A von Neumann computer uses the stored-program concept. The CPU executes a stored program that specifies a sequence of read and write operations on the memory.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
2. Processes and Threads
• In shared memory multiprocessor architectures, such as
SMPs, threads can be used to implement parallelism.
• Historically, hardware vendors have implemented their own
proprietary versions of threads, making portability a concern
for software developers.
• For UNIX systems, a standardized C language threads
programming interface has been specified by the IEEE POSIX
1003.1c standard.
• Implementations that adhere to this standard are referred to
as POSIX threads, or Pthreads.
3. Processes and Threads
• These notes begin with an introduction to concepts,
motivations, and design considerations for using Pthreads.
• Each of the three major classes of routines in the Pthreads
API are then covered:
– Thread Management
– Mutex Variables
– Condition Variables
4. What is a Thread?
• Technically, a thread is defined as an independent stream of
instructions that can be scheduled to run as such by the
operating system.
• But what does this mean?
• The concept of a "procedure" that runs independently from
its main program may best describe a thread.
• Imagine a main program (a.out) that contains a number of
procedures.
• Then imagine all of these procedures being able to be
scheduled to run simultaneously and/or independently by the
operating system.
• That would describe a "multi-threaded" program.
• How is this accomplished?
5. What is a Thread?
• Recall that processes contain information about program
resources and program execution state, including:
– Process ID, process group ID, user ID, and group ID
– Environment
– Working directory.
– Program instructions
– Registers
– Stack
– Heap
– File descriptors
– Signal actions
– Shared libraries
– Inter-process communication tools (such as message
queues, pipes, semaphores, or shared memory).
7. What is a Thread?
• Threads use, and exist within, the process resources
• scheduled by the operating system and run as independent
entities
• duplicate only the bare essential resources that enable
them to exist as executable code
8. What is a Thread?
• Independent flow of control
possible because a thread
maintains its own:
– Stack pointer
– Registers
– Scheduling properties (such as
policy or priority)
– Set of pending and blocked
signals
– Thread specific data.
9. Summary
• In the UNIX environment a thread:
– Exists within a process and uses the process resources
– Has its own independent flow of control as long as its parent
process exists and the OS supports it
– Duplicates only the essential resources it needs to be
independently schedulable
– May share the process resources with other threads that act
equally independently (and dependently)
– Dies if the parent process dies - or something similar
– Is "lightweight" because most of the overhead has already been
accomplished through the creation of its process.
10. Thread Consequences
• Because threads within the same process share resources:
– Changes made by one thread to shared system resources (such as
closing a file) will be seen by all other threads
– Two pointers having the same value point to the same data
– Reading and writing to the same memory locations is possible
– Therefore requires explicit synchronization by the programmer
11. What are Pthreads?
• Historically, hardware vendors have implemented their own
proprietary versions of threads
• These implementations differed substantially from each other
• This makes it difficult for programmers to develop portable
threaded applications
• For UNIX systems, a standardized programming interface has
been specified by the IEEE POSIX 1003.1c standard
• Implementations which adhere to this standard are referred to
as POSIX threads, or Pthreads
• Most hardware vendors now offer Pthreads in addition to their
proprietary API's
12. What are Pthreads?
• Pthreads are defined as a set of C language programming types
and procedure calls
• Implemented with a pthread.h header/include file and a thread
library
• This makes it difficult for programmers to develop portable
threaded applications
• This library may be part of another library, such as libc.
13. Why Pthreads?
• The primary motivation is to realize potential program
performance gains
• When compared to the cost of creating and managing a process,
a thread can be created with much less OS overhead
• Managing threads requires fewer system resources than
managing processes
• All threads within a process share the same address space
• Inter-thread communication is more efficient and, in many
cases, easier to use than inter-process communication
14. Example
• The following table compares timing results for the fork()
subroutine and the pthreads_create() subroutine
• Timings reflect 50,000 process/thread creations, units are in
seconds, no optimization flags
15. Why Pthreads?
• Potential performance gains and practical advantages over non-
threaded applications:
– Overlapping CPU work with I/O
– For example, a program may have sections where it is performing a long
I/O operation
– While one thread is waiting for an I/O system call to complete, CPU
intensive work can be performed by other threads.
• Priority/real-time scheduling
– Tasks which are more important can be scheduled to supersede or
interrupt lower priority tasks.
• Asynchronous event handling
– Tasks which service events of indeterminate frequency and duration can
be interleaved
– For example, a web server can both transfer data from previous requests
and manage the arrival of new requests.
16. Why Pthreads?
• The primary motivation for considering the use of Pthreads on
an SMP architecture is to achieve optimum performance
• If using the Message Passing Interface (MPI) for on-node
communications, there is potential for greatly improved
performance
• MPI libraries usually implement on-node task communication via
shared memory, which involves at least one memory copy
operation (process to process)
• For Pthreads there is no intermediate memory copy required
due to shared memory space
• There is no data transfer, per se.
• It becomes more of a cache-to-CPU or memory-to-CPU
bandwidth (worst case) situation
• These speeds are much higher.
18. Parallel Programming
• On modern, multi-cpu machines, pthreads are ideally suited for
parallel programming
• Whatever applies to parallel programming in general, applies to
parallel pthreads programs
19. Parallel Programming
• There are many considerations for designing parallel programs,
such as:
– What type of parallel programming model to use?
– Problem partitioning
– Load balancing
– Communications
– Data dependencies
– Synchronization and race conditions
– Memory issues
– I/O issues
– Program complexity
– Programmer effort/costs/time
– ...
20. Parallel Programming
• To take advantage of Pthreads, a program must be able to be
organized into discrete, independent tasks which can execute
concurrently
• For example, if routine1 and routine2 can be interchanged,
interleaved and/or overlapped in real time, they are candidates
for threading.
21. Parallel Programming
• Programs having the following characteristics may be well suited
for pthreads:
– Work that can be executed, or data that can be operated on, by multiple
tasks simultaneously
– Block for potentially long I/O waits
– Use many CPU cycles in some places but not others
– Must respond to asynchronous events
– Some work is more important than other work (priority interrupts)
22. Parallel Programming
• Pthreads can also be used for serial applications to emulate
parallel execution
• For most people, the typical web browser runs desktop/laptop
machine with a single CPU
• Many things can "appear" to be happening at the same time
23. Parallel Programming
• Several common models for threaded programs exist:
• Manager/worker:
– a single thread, the manager, assigns work to other threads, the workers
– Typically, the manager handles all input and parcels out work to the other
tasks
– At least two forms of the manager/worker model are common:
• static worker pool
• dynamic worker pool
24. Parallel Programming
• Several common models for threaded programs exist:
• Pipeline:
– a task is broken into a series of sub-operations
– each sub-operation is handled in series, but concurrently, by a different
thread
– An automobile assembly line best describes this model
• Peer:
– similar to the manager/worker model, but after the main thread creates
other threads, it participates in the work.
25. Shared Memory Model
• All threads have access to the same global, shared memory
• Threads also have their own private data
• Programmers are responsible for synchronizing access
(protecting) globally shared data.
26. Thread-safeness
• Thread-safeness: in a nutshell, refers an application's ability to
execute multiple threads simultaneously without "clobbering"
shared data or creating "race" conditions
• Example: an application creates several threads, each of which
makes a call to the same library routine:
– This library routine accesses/modifies a global structure or
location in memory.
– As each thread calls this routine it is possible that they may
try to modify this global structure/memory location at the
same time.
– If the routine does not employ some sort of synchronization
constructs to prevent data corruption, then it is not thread-
safe.
28. Thread-safeness
• The implication to users of external library routines:
• if you aren't 100% certain the routine is thread-safe, then you
take your chances with problems that could arise.
• Recommendation:
• Be careful if your application uses libraries or other objects that
don't explicitly guarantee thread-safeness.
• When in doubt, assume that they are not thread-safe until
proven otherwise
• This can be done by "serializing" the calls to the uncertain
routine, etc.
29. The Pthreads API
• The subroutines which comprise the Pthreads API can be informally
grouped into three major classes:
• Thread management:
– Work directly on threads:
– Creating, detaching, joining, etc.
– They include functions to set/query thread attributes (joinable, scheduling etc.)
• Mutexes:
– Deal with synchronization via a "mutex“
– "mutex“ is an abbreviation for "mutual exclusion“
– Mutex functions provide for creating, destroying, locking and unlocking mutexes
– They are also supplemented by mutex attribute functions that set or modify
attributes associated with mutexes.
30. The Pthreads API
• The subroutines which comprise the Pthreads API can be informally
grouped into three major classes:
• Condition variables:
– Functions that address communications between threads that share a mutex
– They are based upon programmer specified conditions
– This class includes functions to create, destroy, wait and signal based upon
specified variable values
– Functions to set/query condition variable attributes are also included.
• Naming conventions
All identifiers in the threads library begin with pthread_
32. The Pthreads API
• The concept of opaque objects pervades the design of the API
• The basic calls work to create or modify opaque objects
• The opaque objects can be modified by calls to attribute
functions, which deal with opaque attributes
• The Pthreads API contains over 60 subroutines
• We focus on those which are most likely to be immediately
useful to the beginning Pthreads programmer
• For portability, the pthread.h header file should be included in
each source file using the Pthreads library.
33. The Pthreads API
• To compile using GNU on Linux:
gcc -pthread
• Pthread routines
pthread_create(thread,attr,start_routine,arg)
34. The Pthreads API
• Initially, your main() program comprises a single, default thread. All
other threads must be explicitly created by the programmer
pthread_create(thread,attr,start_routine,arg)
• pthread_create creates a new thread and makes it executable
• This routine can be called any number of times from anywhere
within your code
35. Pthread_create
• pthread_create arguments:
– thread:
An opaque, unique identifier for the new thread returned by the subroutine
– attr:
An opaque attribute object that may be used to set thread attributes
You can specify a thread attributes object, or NULL for the default values
– Start_routine:
the C routine that the thread will execute once it is created
– arg:
A single argument that may be passed to start_routine.
It must be passed by reference as a pointer cast of type void.
NULL may be used if no argument is to be passed.
36. Pthreads
• Once created, threads are peers, and may create other threads
• There is no implied hierarchy or dependency between threads
37. Pthread Execution
• Question:
After a thread has been created, how do you know when it will be
scheduled to run by the operating system?
• Answer:
Unless you are using the Pthreads scheduling mechanism, it is up to
the implementation and/or operating system to decide where and
when threads will execute.
Robust programs should not depend upon threads executing in a
specific order.
38. Thread Attributes
• By default, a thread is created with certain attributes
• Some of these attributes can be changed by the programmer via
the thread attribute object
• pthread_attr_init and pthread_attr_destroy are
used to initialize/destroy the thread attribute object
• Other routines are then used to query/set specific attributes in the
thread attribute object
• Some of these attributes will be discussed later
39. Terminating Threads
• pthread_exit is used to explicitly exit a thread
• Typically, the pthread_exit() routine is called after a thread
has completed its work and is no longer required to exist
• If main() finishes before the threads it has created, and exits
with pthread_exit(), the other threads will continue to execute
• Otherwise, they will be automatically terminated when main()
finishes
• The programmer may optionally specify a termination status, which
is stored as a void pointer for any thread that may join the calling
thread
• Cleanup: the pthread_exit() routine does not close files
• Any files opened inside the thread will remain open after the
thread is terminated
40. Discussion
• In subroutines that execute to completion normally, you can often
dispense with calling pthread_exit()
• Unless, of course, you want to pass a return code back
• However, in main(), there is a definite problem if main()
completes before the threads it spawned
• If you don't call pthread_exit() explicitly, when main()
completes, the process (and all threads) will be terminated
• By calling pthread_exit()in main(), the process and all of its
threads will be kept alive even though all of the code in main()
has been executed
41. Example
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM_THREADS 5
void *PrintHello(void *threadid)
{
long tid;
tid = (long)threadid;
printf("Hello World! It's me, thread #%ld!n", tid);
pthread_exit(NULL);
}
42. Example
int main(int argc, char *argv[])
{
pthread_t threads[NUM_THREADS];
int rc;
long t;
for(t=0;t<NUM_THREADS;t++)
{
printf("In main: creating thread %ldn", t);
rc = pthread_create(&threads[t], NULL, PrintHello, (void *)t );
if (rc)
{
printf("ERROR; return code from pthread_create() is %dn", rc);
exit(-1);
}
}
pthread_exit(NULL);
}
43. Example
Output:
In main: creating thread 0
In main: creating thread 1
In main: creating thread 2
In main: creating thread 3
In main: creating thread 4
Hello World! It's me, thread #0!
Hello World! It's me, thread #1!
Hello World! It's me, thread #2!
Hello World! It's me, thread #3!
Hello World! It's me, thread #4!
44. Passing Arguments to Threads
• The pthread_create() routine permits the programmer to
pass one argument to the thread start routine
• For cases where multiple arguments must be passed:
– create a structure which contains all of the arguments
– then pass a pointer to that structure in the pthread_create() routine.
– All arguments must be passed by reference and cast to (void *)
• Question:
How can you safely pass data to newly created threads, given their
non-deterministic start-up and scheduling?
• ANSWER:
Make sure that all passed data is thread safe - that it can not be
changed by other threads
• The three examples that follow demonstrate what not and what to
do.
45. Argument Passing Example 1
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM_THREADS 8
char *messages[NUM_THREADS];
void *PrintHello(void *threadid)
{
int *id_ptr, taskid;
sleep(1);
id_ptr = (int *) threadid;
taskid = *id_ptr;
printf("Thread %d: %sn", taskid, messages[taskid]);
pthread_exit(NULL);
}
This code fragment demonstrates how to pass a simple integer to each thread.
The calling thread uses a unique data structure for each thread, insuring that
each thread's argument remains intact throughout the program.
46. Argument Passing Example 1
int main(int argc, char *argv[])
{
pthread_t threads[NUM_THREADS];
int *taskids[NUM_THREADS];
int rc, t;
messages[0] = "English: Hello World!";
messages[1] = "French: Bonjour, le monde!";
messages[2] = "Spanish: Hola al mundo";
messages[3] = "Klingon: Nuq neH!";
messages[4] = "German: Guten Tag, Welt!";
messages[5] = "Russian: Zdravstvytye, mir!";
messages[6] = "Japan: Sekai e konnichiwa!";
messages[7] = "Latin: Orbis, te saluto!";
47. Argument Passing Example 1
// main, continued
for(t=0;t<NUM_THREADS;t++) {
taskids[t] = (int *) malloc(sizeof(int));
*taskids[t] = t;
printf("Creating thread %dn", t);
rc = pthread_create(&threads[t], NULL, PrintHello, (void *) taskids[t] );
if (rc) {
printf("ERROR; return code from pthread_create() is %dn", rc);
exit(-1);
}
}
pthread_exit(NULL);
}
49. Argument Passing Example 2
/******************************************************************************
* DESCRIPTION:
* A "hello world" Pthreads program which demonstrates another safe way
* to pass arguments to threads during thread creation. In this case,
* a structure is used to pass multiple arguments.
******************************************************************************/
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM_THREADS 8
char *messages[NUM_THREADS];
struct thread_data
{
int thread_id;
int sum;
char *message;
};
struct thread_data thread_data_array[NUM_THREADS];
54. Example 3 - Thread Argument Passing (Incorrect)
/*****************************************************************************
* DESCRIPTION:
* This "hello world" Pthreads program demonstrates an unsafe (incorrect)
* way to pass thread arguments at thread creation. In this case, the
* argument variable is changed by the main thread as it creates new threads.
******************************************************************************/
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM_THREADS 8
void *PrintHello(void *threadid)
{
long taskid;
sleep(1);
taskid = (long) threadid;
printf("Hello from thread %ldn", taskid);
pthread_exit(NULL);
}
55. Example 3 - Thread Argument Passing (Incorrect)
int main(int argc, char *argv[])
{
pthread_t threads[NUM_THREADS];
int rc;
long t;
for(t=0;t<NUM_THREADS;t++) {
printf("Creating thread %ldn", t);
rc = pthread_create(&threads[t], NULL, PrintHello, (void *) &t);
if (rc) {
printf("ERROR; return code from pthread_create() is %dn", rc);
exit(-1);
}
}
pthread_exit(NULL);
}
56. Argument Passing Example 3 Output
Creating thread 0
Creating thread 1
Creating thread 2
Creating thread 3
Creating thread 4
Creating thread 5
Creating thread 6
Creating thread 7
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
Hello from thread 140737488348392
57. Compilation
• The pthread.h header file must be the first included file of each
source file using the threads library.
• Otherwise, the -D_THREAD_SAFE compilation flag should be used
58. Joining and Detaching Threads
• Routines:
• pthread_join(threadid,status)
• pthread_detach(threadid,status)
• pthread_attr_setdetachstate(attr,detachstate)
• pthread_attr_getdetachstate(attr,detachstate)
• The possible attribute states for the last two routines are:
– PTHREAD_CREATE_DETACHED or
– PTHREAD_CREATE_JOINABLE.
59. Joining
• "Joining" is one way to accomplish synchronization between
threads.
• For example:
60. Joining
• The pthread_join() subroutine blocks the calling thread until
the specified threadid thread terminates
• The programmer is able to obtain the target thread's termination
return status if it was specified in the target thread's call to
pthread_exit()
• It is a logical error to attempt simultaneous multiple joins on the
same target thread
61. Joinable or Not?
• When a thread is created, one of its attributes defines whether it is
joinable or detached
• Only threads that are created as joinable can be joined
• If a thread is created as detached, it can never be joined
• The final draft of the POSIX standard specifies that threads should
be created as joinable
• However, not all implementations may follow this.
62. Joinable or Not?
• To explicitly create a thread as joinable or detached, the attr
argument in the pthread_create() routine is used
• The typical 4 step process is:
1. Declare a pthread attribute variable of the pthread_attr_t
data type
2. Initialize the attribute variable with pthread_attr_init()
3. Set the attribute detached status with
pthread_attr_setdetachstate()
4. When done, free library resources used by the attribute with
pthread_attr_destroy()
63. Detach
• The pthread_detach()routine can be used to explicitly detach
a thread even though it was created as joinable
• There is no converse routine
• Recommendations:
• If a thread requires joining, consider explicitly creating it as joinable
• This provides portability as not all implementations may create
threads as joinable by default
• If you know in advance that a thread will never need to join with
another thread, consider creating it in a detached state
• Some system resources may be able to be freed.
64. Example: Pthread Joining
• Example Code - Pthread Joining
• This example demonstrates how to "wait" for thread completions
by using the Pthread join routine.
• Since some implementations of Pthreads may not create threads in
a joinable state, the threads in this example are explicitly created in
a joinable state
65. Example: Pthread Joining
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define NUM_THREADS 4
void *BusyWork(void *t)
{
int i;
long tid;
double result=0.0;
tid = (long) t;
printf("Thread %ld starting...n",tid);
for (i=0; i<1000000; i++) {
result = result + sin(i) * tan(i);
}
printf("Thread %ld done. Result = %en",tid, result);
pthread_exit((void*) t);
}
66. Example: Pthread Joining
int main (int argc, char *argv[])
{
pthread_t thread[NUM_THREADS];
pthread_attr_t attr;
int rc;
long t;
void *status;
/* Initialize and set thread detached attribute */
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);
for(t=0; t<NUM_THREADS; t++) {
printf("Main: creating thread %ldn", t);
rc = pthread_create(&thread[t], &attr, BusyWork, (void *)t);
if (rc) {
printf("ERROR; return code from pthread_create()
is %dn", rc);
exit(-1);
}
}
67. Example: Pthread Joining
/* Free attribute and wait for the other threads */
pthread_attr_destroy(&attr);
for(t=0; t<NUM_THREADS; t++) {
rc = pthread_join(thread[t], &status);
if (rc) {
printf("ERROR; return code from pthread_join()
is %dn", rc);
exit(-1);
}
printf("Main: completed join with thread %ld “
”having a status of %ldn",t,(long)status);
}
printf("Main: program completed. Exiting.n");
pthread_exit(NULL);
}
68. Example: Pthread Joining
Main: creating thread 0
Main: creating thread 1
Thread 0 starting...
Main: creating thread 2
Thread 1 starting...
Main: creating thread 3
Thread 2 starting...
Thread 3 starting...
Thread 1 done. Result = -3.153838e+06
Thread 0 done. Result = -3.153838e+06
Main: completed join with thread 0 having a status of 0
Main: completed join with thread 1 having a status of 1
Thread 3 done. Result = -3.153838e+06
Thread 2 done. Result = -3.153838e+06
Main: completed join with thread 2 having a status of 2
Main: completed join with thread 3 having a status of 3
Main: program completed. Exiting.
69. Miscellaneous Routines
• pthread_self()
returns the unique, system assigned thread ID of the calling thread
• pthread_equal(thread1,thread2)
compares two thread IDs.
If the two IDs are different 0 is returned, otherwise a non-zero
value is returned
• Note that for both of these routines, the thread identifier objects
are opaque and can not be easily inspected
• Because thread IDs are opaque objects, the C language equivalence
operator == should not be used
– to compare two thread IDs against each other, or
– to compare a single thread ID against another value.
70. Miscellaneous Routines
• pthread_once(once_control, init_routine)
• pthread_once executes the init_routine exactly once in a
process.
• The first call to this routine by any thread in the process executes
the given init_routine, without parameters.
• Any subsequent call will have no effect.
• The init_routine routine is typically an initialization routine.
• The once_control parameter is a synchronization control
structure that requires initialization prior to calling pthread_once
• For example:
pthread_once_t once_control=PTHREAD_ONCE_INIT;
71. pthread_yield Subroutine
• Purpose:
Forces the calling thread to relinquish use of its processor
• NOTE: this routine is NOT available on Linux machines and some Solaris
machines. Use sched_yield, from unistd.h, instead.
• Library:
Threads Library (libpthreads.a)
• Syntax:
#include <pthread.h>
void pthread_yield ()
• Description:
The pthread_yield subroutine forces the calling thread to relinquish use of its
processor, and to wait in the run queue before it is scheduled again
If the run queue is empty when the pthread_yield subroutine is called, the calling
thread is immediately rescheduled.
72. Homework
• Review Questions 4.1 to 4.15 on page 200
• Problem 4.10 on page 202
• Problem 5.3 on page 253
• Problem 5.6 on page 254