This document discusses various CPU scheduling policies including FIFO, round robin, shortest job first, priority scheduling, and lottery scheduling. It provides details on how each policy works, its advantages and disadvantages, and examples to illustrate differences in performance between policies. The instructor is Hamza Ali for the course Analyzing and Evaluation Networks at Misurata University in the autumn 2015-2016 term.
Maximum CPU utilization obtained with multiprogramming
CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait
CPU burst followed by I/O burst
CPU burst distribution is of main concern
Maximum CPU utilization obtained with multiprogramming
CPU–I/O Burst Cycle – Process execution consists of a cycle of CPU execution and I/O wait
CPU burst followed by I/O burst
CPU burst distribution is of main concern
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.
In operating system concepts, the scheduling algorithm identifies and schedules the jobs in the queue. It is classified into Preemptive and Non-Preemptive algorithms. The different types of scheduling algorithms includes FCFS, SJF, SJRTF , Round robin and Priority scheduling. This PPT explains the concepts of CPU Scheduling Algorithms with simple examples.
Deadlock happens when two threads are waiting for a mutex owned by the other (circular deadlock between multiple threads is also possible). Therefore, we need to check for deadlock only when a thread fails to lock a mutex. At that point, the Thread Manager needs to suspend all threads and take over to perform a cycle check on mutex dependency. Finding such a cycle is easily done by performing a tree traversal of the dependencies, and marking threads and mutexes along the way. Using this method, we can detect deadlock and identify all threads and mutexes involved in the deadlock.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
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.
In operating system concepts, the scheduling algorithm identifies and schedules the jobs in the queue. It is classified into Preemptive and Non-Preemptive algorithms. The different types of scheduling algorithms includes FCFS, SJF, SJRTF , Round robin and Priority scheduling. This PPT explains the concepts of CPU Scheduling Algorithms with simple examples.
Deadlock happens when two threads are waiting for a mutex owned by the other (circular deadlock between multiple threads is also possible). Therefore, we need to check for deadlock only when a thread fails to lock a mutex. At that point, the Thread Manager needs to suspend all threads and take over to perform a cycle check on mutex dependency. Finding such a cycle is easily done by performing a tree traversal of the dependencies, and marking threads and mutexes along the way. Using this method, we can detect deadlock and identify all threads and mutexes involved in the deadlock.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
Future Visions: Predictions to Guide and Time Tech Innovation, Peter Udo DiehlPeter Udo Diehl
I'm excited to share my latest predictions on how AI, robotics, and other technological advancements will reshape industries in the coming years. The slides explore the exponential growth of computational power, the future of AI and robotics, and their profound impact on various sectors.
Why this matters:
The success of new products and investments hinges on precise timing and foresight into emerging categories. This deck equips founders, VCs, and industry leaders with insights to align future products with upcoming tech developments. These insights enhance the ability to forecast industry trends, improve market timing, and predict competitor actions.
Highlights:
▪ Exponential Growth in Compute: How $1000 will soon buy the computational power of a human brain
▪ Scaling of AI Models: The journey towards beyond human-scale models and intelligent edge computing
▪ Transformative Technologies: From advanced robotics and brain interfaces to automated healthcare and beyond
▪ Future of Work: How automation will redefine jobs and economic structures by 2040
With so many predictions presented here, some will inevitably be wrong or mistimed, especially with potential external disruptions. For instance, a conflict in Taiwan could severely impact global semiconductor production, affecting compute costs and related advancements. Nonetheless, these slides are intended to guide intuition on future technological trends.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
The infamous Mallox is the digital Robin Hoods of our time, except they steal from everyone and give to themselves. Since mid-2021, they've been playing hide and seek with unsecured Microsoft SQL servers, encrypting data, and then graciously offering to give it back for a modest Bitcoin donation.
Mallox decided to go shopping for new malware toys, adding the Remcos RAT, BatCloak, and a sprinkle of Metasploit to their collection. They're now playing a game of "Catch me if you can" with antivirus software, using their FUD obfuscator packers to turn their ransomware into the digital equivalent of a ninja.
-------
This document provides a analysis of the Target Company ransomware group, also known as Smallpox, which has been rapidly evolving since its first identification in June 2021.
The analysis delves into various aspects of the group's operations, including its distinctive practice of appending targeted organizations' names to encrypted files, the evolution of its encryption algorithms, and its tactics for establishing persistence and evading defenses.
The insights gained from this analysis are crucial for informing defense strategies and enhancing preparedness against such evolving cyber threats.
From Daily Decisions to Bottom Line: Connecting Product Work to Revenue by VP...
chapter03sec02_تحليل وتقييم.pptx
1. Misurata University
Faculty of Information Technology
Analyzing and evaluation Networks
Performance CN 422
Instructor : HAMZA ALI
Autumn 2015-2016
Scheduling Policies
1
Modified by: Ahmad S. AL-Majouk
2. Scheduling Policies
■ FIFO (first in, first out)
■ Round robin
■ SJF (shortest job first)
■ Priority Scheduling
■ Lottery scheduling
■ This is obviously an incomplete list
* 2
3. FIFO
FIFO is an acronym for First In, First Out, a method for organizing
and manipulating a data buffer, or data stack, where the oldest
entry, or 'bottom' of the stack, is processed first. It is analogous
to processing a queue with first-come, first-served (FCFS)
behavior: where the people leave the queue in the order in
which they arrive.
* 3
4. FIFO
■ FIFO: assigns the CPU based on the order of
requests
❑ Nonpreemptive: A process keeps running on a CPU
until it is blocked or terminated
❑ Also known as FCFS (first come, first serve)
+ Simple
- Short jobs can get stuck behind long jobs
* 4
5. FIFO
■
Suppose we have three jobs of equal length
A B Time
C
turnaround time of A
turnaround time of B
turnaround time of C
FIFO
* 5
6. Round Robin
■ Round Robin (RR) periodically releases the CPU
from long-running jobs
❑ Based on timer interrupts so short jobs can get a fair
share of CPU time
❑ Preemptive : a process can be forced to leave its
running state and replaced by another running process
❑ Time slice: interval between timer interrupts
* 6
7. Round Robin (Cont.)
■ If time slice is too long
❑ Scheduling degrades to FIFO
■ If time slice is too short
❑ Throughput suffers
❑ Context switching cost dominates
* 7
8. FIFO vs. Round Robin
■
Suppose we have three jobs of equal length
A B C A B C Ti
m
e
A B C
turnaround time of A
turnaround time of B
turnaround time of C
Round Robin
A B Time
C
turnaround time of A
turnaround time of B
turnaround time of C
FIFO
* 8
9. FIFO vs. Round Robin
■ Round Robin
+ Shorter response time
+ Fair sharing of CPU
- Not all jobs are preemptable
- Not good for jobs of the same length (longer turnaround time)
- More precisely, not good in terms of the turnaround time, because the
turnaround of job A (last graph for example) in Robin Round state is
longer than turnaround time of the same job in FIFO state.
* 9
Modified by: Ahmad S. Al-Majouk
10. * Instructor: Ahmad S. Al-Majouk
10
Shortest Job First (SJF)
⮚ Other name of this algorithm is Shortest-Process-Next (SPN).
Also known as STCF (shortest time to completion first).
⮚ Like FCFS, SJF is non preemptive discipline in which waiting job
(or process) with the smallest estimated run-time-to-completion is
run next.
In other words, when CPU is available, it is assigned to the process
that has smallest next CPU burst.
⮚ The SJF scheduling is especially appropriate for batch jobs for
which the run times are known in advance.
⮚ The SJF algorithm favors short jobs (or process) at the expense
of longer ones.
⮚ The obvious problem with SJF scheme is that it requires precise
knowledge of how long a job or process will run, and this information
is not usually available.
⮚ The best SJF algorithm can do is to rely on user estimates of run
times.
11. SJF Illustrated
A B Time
C
turnaround time of A
turnaround time of B
turnaround time of C
Shortest Job First
response time of A =
0
response time of
B
response time of
C
wait time of A =
0
wait time of
B
wait time of
C
* 11
12. Priority Scheduling (Multilevel Queues)
■ Priority scheduling: The process with the
highest priority runs first
■ Priority 0:
■ Priority 1:
■ Priority 2:
■ Assume that low numbers represent high priority
A
B
C
A B Ti
m
e
C
Priority
Scheduling
*
12
13. Multilevel Feedback Queues
• Multilevel feedback queues use multiple
queues with different priorities
– Round robin at each priority level
– Run highest priority jobs first
– Once those finish, run next highest priority, etc
– Jobs start in the highest priority queue
– If time slice expires, drop the job by one level
– If time slice does not expire, push the job up by one
level
* 13
Instructor: Ahmad S. Al-Majouk
14. Lottery Scheduling
■ Lottery scheduling is an adaptive scheduling
approach to address the fairness problem
❑ Each process owns some tickets
❑ On each time slice, a ticket is randomly picked
❑ On average, the allocated CPU time is proportional to
the number of tickets given to each job
* 14
15. Lottery Scheduling (Cont.)
■ To approximate SJF, short jobs get more tickets
■ To avoid starvation, each job gets at least one
ticket
* 15
16. Lottery Scheduling Example
• short jobs: 10 tickets each
• long jobs: 1 ticket each
# short jobs/#
long jobs
% of CPU for
each short job
% of CPU for
each long job
1/1 91% 9%
0/2 0% 50%
2/0 50% 0%
10/1 10% 1%
1/10 50% 5%
* 16
Instructor: Ahmad S. AL-Majouk