-- WARNING: All output lines starting with a double dash are there to show you
-- how the simulation proceeds and are NEITHER REQUIRED NOR RECOMMENDED.
-- ARRIVAL event for process 3 at time 0 ms
Process 3 starts at time 0 ms
Process Table:
There are no active processes.
-- Process 3 requests a core at time 0 ms for 100 ms.
-- Process 3 will release a core at time 100 ms.
-- ARRIVAL event for process 5 at time 3 ms
Process 5 starts at time 3 ms
Process Table:
Process 3 is RUNNING.
-- Process 5 requests a core at time 3 ms for 120 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- ARRIVAL event for process 7 at time 5 ms
Process 7 starts at time 5 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
-- Process 7 requests a core at time 5 ms for 120 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- ARRIVAL event for process 9 at time 8 ms
Process 9 starts at time 8 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
Process 7 is READY.
-- Process 9 requests a core at time 8 ms for 100 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- ARRIVAL event for process 11 at time 13 ms
Process 11 starts at time 13 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
Process 7 is READY.
Process 9 is READY.
-- Process 11 requests a core at time 13 ms for 120 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 3 at time 100 ms
-- Process 5 will release a core at time 220 ms.
-- Process 3 requests SSD access at time 100 ms for 0 ms.
-- Process 3 will release the SSD at time 100 ms.
-- SSD completion event for process 3 at time 100 ms
-- Process 3 requests a core at time 100 ms for 80 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 5 at time 220 ms
-- Process 7 will release a core at time 340 ms.
-- Process 5 requests SSD access at time 220 ms for 0 ms.
-- Process 5 will release the SSD at time 220 ms.
-- SSD completion event for process 5 at time 220 ms
-- Process 5 requests a core at time 220 ms for 60 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 7 at time 340 ms
-- Process 9 will release a core at time 440 ms.
-- Process 7 requests SSD access at time 340 ms for 0 ms.
-- Process 7 will release the SSD at time 340 ms.
-- SSD completion event for process 7 at time 340 ms
-- Process 7 requests a core at time 340 ms for 60 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 9 at time 440 ms
-- Process 11 will release a core at time 560 ms.
-- Process 9 requests SSD access at time 440 ms for 0 ms.
-- Process 9 will release the SSD a ...
-- WARNING All output lines starting with a double dash are therehirstcruz
-- WARNING: All output lines starting with a double dash are there to show you
-- how the simulation proceeds and are NEITHER REQUIRED NOR RECOMMENDED.
-- ARRIVAL event for process 3 at time 0 ms
Process 3 starts at time 0 ms
Process Table:
There are no active processes.
-- Process 3 requests a core at time 0 ms for 100 ms.
-- Process 3 will release a core at time 100 ms.
-- ARRIVAL event for process 5 at time 3 ms
Process 5 starts at time 3 ms
Process Table:
Process 3 is RUNNING.
-- Process 5 requests a core at time 3 ms for 120 ms.
-- Process 5 will release a core at time 123 ms.
-- ARRIVAL event for process 7 at time 5 ms
Process 7 starts at time 5 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
-- Process 7 requests a core at time 5 ms for 120 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- ARRIVAL event for process 9 at time 8 ms
Process 9 starts at time 8 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
Process 7 is READY.
-- Process 9 requests a core at time 8 ms for 100 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- ARRIVAL event for process 11 at time 13 ms
Process 11 starts at time 13 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
Process 7 is READY.
Process 9 is READY.
-- Process 11 requests a core at time 13 ms for 120 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 3 at time 100 ms
-- Process 7 will release a core at time 220 ms.
-- Process 3 requests SSD access at time 100 ms for 0 ms.
-- Process 3 will release the SSD at time 100 ms.
-- SSD completion event for process 3 at time 100 ms
-- Process 3 requests a core at time 100 ms for 80 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 5 at time 123 ms
-- Process 9 will release a core at time 223 ms.
-- Process 5 requests SSD access at time 123 ms for 0 ms.
-- Process 5 will release the SSD at time 123 ms.
-- SSD completion event for process 5 at time 123 ms
-- Process 5 requests a core at time 123 ms for 60 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 7 at time 220 ms
-- Process 11 will release a core at time 340 ms.
-- Process 7 requests SSD access at time 220 ms for 0 ms.
-- Process 7 will release the SSD at time 220 ms.
-- SSD completion event for process 7 at time 220 ms
-- Process 7 requests a core at time 220 ms for 60 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 9 at time 223 ms
-- Process 3 will release a core at time 303 ms.
-- Process 9 requests SSD access at time 223 ms for 0 ms.
-- Process 9 will release the SSD at time 223 ms.
-- SSD completion event ...
Ceph FileStore with Optane drive & Scrub OptimizationFei (James) Liu
Optane drive is the new high performance drive built by Intel .Alibaba bring it to test with Ceph filestore and we got a good performance gain. In the slides, we also show one of our work to scub optimization for 16% performance gain
-- WARNING All output lines starting with a double dash are therehirstcruz
-- WARNING: All output lines starting with a double dash are there to show you
-- how the simulation proceeds and are NEITHER REQUIRED NOR RECOMMENDED.
-- ARRIVAL event for process 3 at time 0 ms
Process 3 starts at time 0 ms
Process Table:
There are no active processes.
-- Process 3 requests a core at time 0 ms for 100 ms.
-- Process 3 will release a core at time 100 ms.
-- ARRIVAL event for process 5 at time 3 ms
Process 5 starts at time 3 ms
Process Table:
Process 3 is RUNNING.
-- Process 5 requests a core at time 3 ms for 120 ms.
-- Process 5 will release a core at time 123 ms.
-- ARRIVAL event for process 7 at time 5 ms
Process 7 starts at time 5 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
-- Process 7 requests a core at time 5 ms for 120 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- ARRIVAL event for process 9 at time 8 ms
Process 9 starts at time 8 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
Process 7 is READY.
-- Process 9 requests a core at time 8 ms for 100 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- ARRIVAL event for process 11 at time 13 ms
Process 11 starts at time 13 ms
Process Table:
Process 3 is RUNNING.
Process 5 is RUNNING.
Process 7 is READY.
Process 9 is READY.
-- Process 11 requests a core at time 13 ms for 120 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 3 at time 100 ms
-- Process 7 will release a core at time 220 ms.
-- Process 3 requests SSD access at time 100 ms for 0 ms.
-- Process 3 will release the SSD at time 100 ms.
-- SSD completion event for process 3 at time 100 ms
-- Process 3 requests a core at time 100 ms for 80 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 5 at time 123 ms
-- Process 9 will release a core at time 223 ms.
-- Process 5 requests SSD access at time 123 ms for 0 ms.
-- Process 5 will release the SSD at time 123 ms.
-- SSD completion event for process 5 at time 123 ms
-- Process 5 requests a core at time 123 ms for 60 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 7 at time 220 ms
-- Process 11 will release a core at time 340 ms.
-- Process 7 requests SSD access at time 220 ms for 0 ms.
-- Process 7 will release the SSD at time 220 ms.
-- SSD completion event for process 7 at time 220 ms
-- Process 7 requests a core at time 220 ms for 60 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 9 at time 223 ms
-- Process 3 will release a core at time 303 ms.
-- Process 9 requests SSD access at time 223 ms for 0 ms.
-- Process 9 will release the SSD at time 223 ms.
-- SSD completion event ...
Ceph FileStore with Optane drive & Scrub OptimizationFei (James) Liu
Optane drive is the new high performance drive built by Intel .Alibaba bring it to test with Ceph filestore and we got a good performance gain. In the slides, we also show one of our work to scub optimization for 16% performance gain
Talk held at DevOps Gathering 2019 in Bochum on 2019-03-13.
Abstract: This talk will address one of the most common challenges of organizations adopting Kubernetes on a medium to large scale: how to keep cloud costs under control without babysitting each and every deployment and cluster configuration? How to operate 80+ Kubernetes clusters in a cost-efficient way for 200+ autonomous development teams?
This talk provides insights on how Zalando approaches this problem with central cost optimizations (e.g. Spot), cost monitoring/alerting, active measures to reduce resource slack, and automated cluster housekeeping. We will focus on how to ingrain cost efficiency in tooling and developer workflows while balancing rigid cost control with developer convenience and without impacting availability or performance. We will show our use case running Kubernetes on AWS, but all shown tools are open source and can be applied to most other infrastructure environments.
Best Practices & Performance Tuning - OpenStack Cloud Storage with Ceph - In this presentation, we discuss best practices and performance tuning for OpenStack cloud storage with Ceph to achieve high availability, durability, reliability and scalability at any point of time. Also discuss best practices for failure domain, recovery, rebalancing, backfilling, scrubbing, deep-scrubbing and operations
How We Made Scylla Maintenance Easier, Safer and FasterScyllaDB
Many Scylla maintenance operations require significant data movement between database nodes in a cluster. It is not an easy task to make the management operations efficient while maintaining minimum impact on the workload all the time. In this talk, we will share how we made those maintenance operations easier, safer and faster with the new Scylla features and improvements, e.g., seedless, repair based node operations, smarter off-strategy compaction, io bandwidth limiter for repair and compaction, parallel repair in Scylla Manger and more.
Global Internet is not ready for IPv6 only
Cisco support NAT64 above ASR Series
User bandwidth management is way to complex
464 XLAT does not support general WiFi routers
Existing server system support
Operation & Security Policy
We have almost 50k active Customer and planning for 500k
Overhead cost of deployment (NAT64 & DNS64)
Optimizing Kubernetes Resource Requests/Limits for Cost-Efficiency and LatencyHenning Jacobs
Talk given at JAX DevOps London on 2019-05-15
Kubernetes has the concept of resource requests and limits. Pods get scheduled on the nodes based on their requests and optionally limited in how much of the resource they can consume. Understanding and optimizing resource requests/limits is crucial both for reducing resource "slack" and ensuring application performance/low-latency. This talk shows our approach to monitoring and optimizing Kubernetes resources for 90+ clusters to achieve cost-efficiency and reducing impact for latency-critical applications. All shown tools are open source and can be applied to most Kubernetes deployments. Topics covered in the talk include: understanding resource requests and limits, cgroups and CFS quota behavior, contributing factors to cluster costs (in public clouds), and best practices for managing Kubernetes resources.
Optimizing Kubernetes Resource Requests/Limits for Cost-Efficiency and Latenc...Henning Jacobs
Talk given at JAX DevOps London on 2019-05-15.
Kubernetes has the concept of resource requests and limits. Pods get scheduled on the nodes based on their requests and optionally limited in how much of the resource they can consume. Understanding and optimizing resource requests/limits is crucial both for reducing resource "slack" and ensuring application performance/low-latency. This talk shows our approach to monitoring and optimizing Kubernetes resources for 90+ clusters to achieve cost-efficiency and reducing impact for latency-critical applications. All shown tools are open source and can be applied to most Kubernetes deployments. Topics covered in the talk include: understanding resource requests and limits, cgroups and CFS quota behavior, contributing factors to cluster costs (in public clouds), and best practices for managing Kubernetes resources.
Talk given by David Peterson, Lead Systems Engineer at Salesforce, at StackiFest in March 2016
Enterprise bare metal provisioning using Stacki at Salesforce/Pardot and how we've configured it in our environment. It used to take the Ops teams hours to do end-to-end provisioning with chef integration to now it takes about 15 minutes with it all being automated. In this presentation, I will discuss:
- Why we chose Stacki
- Hardware and provisioning requirements
- Stacki configuration with chef integration
- ZFS and data safe re-provisioning
- Detecting issues and adhoc reporting
Cassandra Day Chicago 2015: DataStax Enterprise & Apache Cassandra Hardware B...DataStax Academy
Speaker(s): Kathryn Erickson, Engineering at DataStax
During this session we will discuss varying recommended hardware configurations for DSE. We’ll get right to the point and provide quick and solid recommendations up front. After we get the main points down take a brief tour of the history of database storage and then focus on designing a storage subsystem that won't let you down.
Ian Robinson, Engineer at Neo4j, talks about how you productionize your Neo4j-based application. In this talk from GraphConnect San Francisco 2015, he looks at some of the most important considerations around designing, building and operating a Neo4j app.
Topics include:
* Where Neo4j fits in your application architecture, in both its embedded and server modes
* How to configure its clustering for high availability and high read throughput
* Backup strategies
* The new monitoring capabilities in Neo4j 2.3
Which of the following statements regarding components of a time ser.docxjolleybendicty
Which of the following statements regarding components of a time series are true? (Check all that apply.)
[removed]
1
Trend is a constant or steady increase or decrease in the data/measurements over time.
[removed]
2
Cyclical variation is gradual movement around the trend line that is
always
attributable (caused by) the business cycle and economic conditions.
[removed]
3
Seasonal variation is
unpredictable
increases and decreases that occur within a calendar year.
[removed]
4
Irregularity is what is left after taking into account Trend, Cyclical, and Seasonal behavior. It has no observable patterns. It is random.
.
Which of the works we read was used by President Bushs 2002 appoint.docxjolleybendicty
Which of the works we read was used by President Bush's 2002 appointed bioethical committee as a warning about possible problems/dangers with embryonic stem cell research?
Explain the importance of the
setting
(of INSIDE the house) in "Home Burial."
(a) Identify the
author
of
Fences
, (b) discuss his/her
ongoing drama project
for the 29th century, (c) the
progress completed
on that project, and (d)
how
Fences
fits into the project
.
Identify the effect of Troy's actions throughout the drama on Rose, Cory, and Raynell.
What is the
symbolic role
of "fences" in the drama
Fences
? (Identify at least
three uses
of fences throughout the play.)
If we consider these two stories
together,
DISCUSS
two types of literary criticism
that might best be used to study them as a
whole
: "The Story of an Hour," "The Birthmark," and "Home Burial."
DO NOT USE READER RESPONSE AS ONE OF THE LITERARY APPROACHES.
Identify
two literary works
from the works we have studied in these units and explain how
GENDER CRITICISM
might best be used to aid in understanding the works. Be sure to identify
specific time
periods
and how these time periods might affect a contemporary gender reading.
(Do not use ,"The Story of an Hour," "The Birthmark" or "Home Burial" to answer this questions)
Identify
two literary works, along with their authors,
from those that we studied and explain specifically how
BIOGRAPHICAL CRITICISM
might be used to aid in understanding the works. Remember that biographical criticism can be used only when there is a known established connection between the author and his/her work so that means you will have to connect the works to the authors' lives.
Identify
one literary work
from the works we studied and explain how
HISTORICAL CRITICISM
might best be used to aid in understanding this particular wor. Be sure to identify the specific time periods during which the work was written.
(Do not use "The Story of an Hour," "Home Burial" or "The Birthmark" to answer this question.)
Discuss the similarities and differences between the character in O'Brien's "The Things They Carried" and in Henry in Erdrich's "The Red
Convertible."
The frist five just couple sentences and next five a little bit longer than
.
More Related Content
Similar to -- WARNING All output lines starting with a double dash are there
Talk held at DevOps Gathering 2019 in Bochum on 2019-03-13.
Abstract: This talk will address one of the most common challenges of organizations adopting Kubernetes on a medium to large scale: how to keep cloud costs under control without babysitting each and every deployment and cluster configuration? How to operate 80+ Kubernetes clusters in a cost-efficient way for 200+ autonomous development teams?
This talk provides insights on how Zalando approaches this problem with central cost optimizations (e.g. Spot), cost monitoring/alerting, active measures to reduce resource slack, and automated cluster housekeeping. We will focus on how to ingrain cost efficiency in tooling and developer workflows while balancing rigid cost control with developer convenience and without impacting availability or performance. We will show our use case running Kubernetes on AWS, but all shown tools are open source and can be applied to most other infrastructure environments.
Best Practices & Performance Tuning - OpenStack Cloud Storage with Ceph - In this presentation, we discuss best practices and performance tuning for OpenStack cloud storage with Ceph to achieve high availability, durability, reliability and scalability at any point of time. Also discuss best practices for failure domain, recovery, rebalancing, backfilling, scrubbing, deep-scrubbing and operations
How We Made Scylla Maintenance Easier, Safer and FasterScyllaDB
Many Scylla maintenance operations require significant data movement between database nodes in a cluster. It is not an easy task to make the management operations efficient while maintaining minimum impact on the workload all the time. In this talk, we will share how we made those maintenance operations easier, safer and faster with the new Scylla features and improvements, e.g., seedless, repair based node operations, smarter off-strategy compaction, io bandwidth limiter for repair and compaction, parallel repair in Scylla Manger and more.
Global Internet is not ready for IPv6 only
Cisco support NAT64 above ASR Series
User bandwidth management is way to complex
464 XLAT does not support general WiFi routers
Existing server system support
Operation & Security Policy
We have almost 50k active Customer and planning for 500k
Overhead cost of deployment (NAT64 & DNS64)
Optimizing Kubernetes Resource Requests/Limits for Cost-Efficiency and LatencyHenning Jacobs
Talk given at JAX DevOps London on 2019-05-15
Kubernetes has the concept of resource requests and limits. Pods get scheduled on the nodes based on their requests and optionally limited in how much of the resource they can consume. Understanding and optimizing resource requests/limits is crucial both for reducing resource "slack" and ensuring application performance/low-latency. This talk shows our approach to monitoring and optimizing Kubernetes resources for 90+ clusters to achieve cost-efficiency and reducing impact for latency-critical applications. All shown tools are open source and can be applied to most Kubernetes deployments. Topics covered in the talk include: understanding resource requests and limits, cgroups and CFS quota behavior, contributing factors to cluster costs (in public clouds), and best practices for managing Kubernetes resources.
Optimizing Kubernetes Resource Requests/Limits for Cost-Efficiency and Latenc...Henning Jacobs
Talk given at JAX DevOps London on 2019-05-15.
Kubernetes has the concept of resource requests and limits. Pods get scheduled on the nodes based on their requests and optionally limited in how much of the resource they can consume. Understanding and optimizing resource requests/limits is crucial both for reducing resource "slack" and ensuring application performance/low-latency. This talk shows our approach to monitoring and optimizing Kubernetes resources for 90+ clusters to achieve cost-efficiency and reducing impact for latency-critical applications. All shown tools are open source and can be applied to most Kubernetes deployments. Topics covered in the talk include: understanding resource requests and limits, cgroups and CFS quota behavior, contributing factors to cluster costs (in public clouds), and best practices for managing Kubernetes resources.
Talk given by David Peterson, Lead Systems Engineer at Salesforce, at StackiFest in March 2016
Enterprise bare metal provisioning using Stacki at Salesforce/Pardot and how we've configured it in our environment. It used to take the Ops teams hours to do end-to-end provisioning with chef integration to now it takes about 15 minutes with it all being automated. In this presentation, I will discuss:
- Why we chose Stacki
- Hardware and provisioning requirements
- Stacki configuration with chef integration
- ZFS and data safe re-provisioning
- Detecting issues and adhoc reporting
Cassandra Day Chicago 2015: DataStax Enterprise & Apache Cassandra Hardware B...DataStax Academy
Speaker(s): Kathryn Erickson, Engineering at DataStax
During this session we will discuss varying recommended hardware configurations for DSE. We’ll get right to the point and provide quick and solid recommendations up front. After we get the main points down take a brief tour of the history of database storage and then focus on designing a storage subsystem that won't let you down.
Ian Robinson, Engineer at Neo4j, talks about how you productionize your Neo4j-based application. In this talk from GraphConnect San Francisco 2015, he looks at some of the most important considerations around designing, building and operating a Neo4j app.
Topics include:
* Where Neo4j fits in your application architecture, in both its embedded and server modes
* How to configure its clustering for high availability and high read throughput
* Backup strategies
* The new monitoring capabilities in Neo4j 2.3
Which of the following statements regarding components of a time ser.docxjolleybendicty
Which of the following statements regarding components of a time series are true? (Check all that apply.)
[removed]
1
Trend is a constant or steady increase or decrease in the data/measurements over time.
[removed]
2
Cyclical variation is gradual movement around the trend line that is
always
attributable (caused by) the business cycle and economic conditions.
[removed]
3
Seasonal variation is
unpredictable
increases and decreases that occur within a calendar year.
[removed]
4
Irregularity is what is left after taking into account Trend, Cyclical, and Seasonal behavior. It has no observable patterns. It is random.
.
Which of the works we read was used by President Bushs 2002 appoint.docxjolleybendicty
Which of the works we read was used by President Bush's 2002 appointed bioethical committee as a warning about possible problems/dangers with embryonic stem cell research?
Explain the importance of the
setting
(of INSIDE the house) in "Home Burial."
(a) Identify the
author
of
Fences
, (b) discuss his/her
ongoing drama project
for the 29th century, (c) the
progress completed
on that project, and (d)
how
Fences
fits into the project
.
Identify the effect of Troy's actions throughout the drama on Rose, Cory, and Raynell.
What is the
symbolic role
of "fences" in the drama
Fences
? (Identify at least
three uses
of fences throughout the play.)
If we consider these two stories
together,
DISCUSS
two types of literary criticism
that might best be used to study them as a
whole
: "The Story of an Hour," "The Birthmark," and "Home Burial."
DO NOT USE READER RESPONSE AS ONE OF THE LITERARY APPROACHES.
Identify
two literary works
from the works we have studied in these units and explain how
GENDER CRITICISM
might best be used to aid in understanding the works. Be sure to identify
specific time
periods
and how these time periods might affect a contemporary gender reading.
(Do not use ,"The Story of an Hour," "The Birthmark" or "Home Burial" to answer this questions)
Identify
two literary works, along with their authors,
from those that we studied and explain specifically how
BIOGRAPHICAL CRITICISM
might be used to aid in understanding the works. Remember that biographical criticism can be used only when there is a known established connection between the author and his/her work so that means you will have to connect the works to the authors' lives.
Identify
one literary work
from the works we studied and explain how
HISTORICAL CRITICISM
might best be used to aid in understanding this particular wor. Be sure to identify the specific time periods during which the work was written.
(Do not use "The Story of an Hour," "Home Burial" or "The Birthmark" to answer this question.)
Discuss the similarities and differences between the character in O'Brien's "The Things They Carried" and in Henry in Erdrich's "The Red
Convertible."
The frist five just couple sentences and next five a little bit longer than
.
Which of these articles confirms or negates your view on housing ava.docxjolleybendicty
Which of these articles confirms or negates your view on housing availability and affordability?
ARTICLE:
Butler, T. and Lees, L. (2006). Super-gentrification in Barnsbury, London: Globalization and Gentrifying Global Elites at the NeighbourhoodLevel.
Transactions of the Institute of British Geographers,
31, 467-487.
or
ARTICLE:
Sivam, A. (2003). Housing Supply in Delhi.
Cities
20 (2003): 135-141.
Must begin with a quotation from either article (with page number);
Must have
at least 300 words
(not including the required quotation) with proper spelling and grammar;
Must include your explanation of how the quotation address one of the Meta-themes
.
Which of these images represents the following system of equations b.docxjolleybendicty
Which of these images represents the following system of equations being solved graphically?
6x – 6y = -48
-10x + 4y = 92
2. Which of these images represents the following system of equations being solved graphically?
6x - 2y = -16
4x + 4y = -32
3. Which of these images represents the following system of equations being solved graphically?
-6x + 2y = -44
-10x + 2y = -60
4. Which of these images represents the following system of equations being solved graphically?
-4x - 10y = 132
-4x + 2y = 12
5. Which of these images represents the following system of equations being solved graphically?
7x – y = 10
4x + y = 1
6. How many solutions exist for the following system of equations?
-10x – 10y = 20
-10x + 6y = -108
None 1
2 infinitely many
7. How many solutions exist for the following system of equations?
-4x – 6y = -28
2x + 3y = 14
None 1
2 infinitely many
8. How many solutions exist for the following system of equations?
4x - 6y = -52
6x - 2y = -64
none 1
2 infinitely many
9. How many solutions exist for the following system of equations?
4x - 8y = 30
6x - 12y = -64
none 1
2 infinitely many
Part 2
Select the best answer from the choices provided. (Each question is worth one point)
10. In the following system of equations, what does x equal?
0x + 8y = -16
-10x + 8y = 64
x = -8 x = -16
x = -2 x = 0
11. In the following system of equations, what does y equal?
0x + 8y = -16
-10x + 8y = 64
y = -8 y = -16
y = -2 y = 0
12. In the following system of equations, what does y equal?
-2x – 0y = -4
-6x – 2y = -12
y = 2 y = -2
y = -10 y = 0
13. In the following system of equations, what does y equal?
0x + 8y = 16
-2x - 8y = -24
y = -2 y = 2
y = 0 y = 4
14. In the following system of equations, what does y equal?
-8x - 8y = 0
-8x + 8y = -128
y = 8 y = -8
y = -2 y = 0
15. In the following system of equations, what does x equal?
-8x - 8y = 0
-8x + 8y = -128
x = 8 x = -8
x = -2 x = 0
16. In the following system of equations, what does y equal?
-10x - 2y = 56
6x - 2y = -40
y = 6 y = -6
y = 2 y = -2
17. In the following system of equations, what does x equal?
-10x - 2y = 56
6x - 2y = -40
x = 6 x = -6
x = 2 x = -2
18. In the following system of equations, what does x equal?
8x - 8y = 16
4x + 4y = -72
x = -10 x = 10
x = -8 x = 8
Part 3
Select the best answer from the choices provided. (Each question is worth one point)
19. In the following system of equations, what does x equal?
5x + 9y = 0
6x + 6y = 2
x = 3
4
x = -3
4
.
Which of these images tells us the most about the rise, fall and the.docxjolleybendicty
Which of these images tells us the most about the rise, fall and the lasting legacy of the Roman Empire?
What do these images tell us about the early history of the Christian church?
the book is the making of the west third edition! Chapter 4 Pages 127 (Household Religious Shrine), 136 (Aqueduct at Nimes, France) 165 (Julius Caesar Coin).
.
Which of the following was a component of the Earths Hadean atm.docxjolleybendicty
Which of the following was a component of the Earth's Hadean atmosphere?
Choose one:
A. oxygen
B. ammonia
C. iron
D. ozone
Which of the following statements is true?
Choose one:
A. Limestone that contains coral fossils probably developed in a shallow sea.
B. A piece of gneiss radiometrically dated as 4.4 billion years old is the oldest whole rock yet found.
C. Marine limestone that overlies alluvial fan conglomerate shows that the sea level dropped at that site.
D. Shale that contains land plants probably formed in an alluvial fan or a stream channel.
Which of the following refers to fossils of early multicellular invertebrates that are 565 to 620 million years old?
Choose one:
A. Rodinia
B. stromatolites
C. cyanobacteria
D. Ediacaran fauna
Banded iron formations (BIFs) formed
Choose one:
A. beneath the Laurentide ice sheet.
B. in the Proterozoic deep ocean.
C. in alluvial fans at the base of the proto-Appalachian Mountains.
D. during uplift of the Tibetan Plateau.
Geologists believe that the impact of a 13-km-wide meteorite 65 million years ago
Choose one:
A. generated 20-km-high tsunamis.
B. generated a hot-air blast and blaze that caused worldwide forest fires.
C. ejected debris into the atmosphere that produced acid rain.
D. ejected chemicals into the atmosphere that caused thousands of years of winter-like night conditions that halted photosynthesis.
The continents that made up Pangaea came together in the early Paleozoic but began to split apart during the
Choose one:
A. late Paleozoic.
B. Late Triassic/Early Jurassic.
C. middle Proterozoic.
D. Early Devonian.
We know that the atmosphere became more oxygen-rich around 1.8 billion years ago (Ga) because of geologic evidence such as
Choose one:
A. BIFs that occurred prior to 1.8 Ga but disappeared from the rock record after that time.
B. abundant fossils of land plants, signifying the start of photosynthesis.
C. redbeds that formed after 1.8 Ga.
D. the presence of abundant pyrite after 1.8 Ga.
According to this diagram, which shows the stratigraphic record produced when sea level rises and falls over time, which of the following statements is true?
Choose one:
A. Shale, covered by limestone and then sand, represents a transgression.
B. Unconformities develop when sea level is at its highest point.
C. Sand, covered by limestone and then shale, represents a sea-level rise.
D. Each sequence represents two cycles of sea-level rise and fall.
Solar storms, like the one in the video, may have caused a dramatic increase in nitrous oxide in Earth's early atmosphere, allowing it to warm enough to support life. What is the earliest life form found in the fossil record?
Choose one:
A. trilobites
B. cells from an unknown organism
C. cyanobacteria
D. stromatolites
This video discusses how glacial deposits support the theory that Antarctica and North America were once connected. Think back to the Proterozoic Eon and the supercontinent named .
Which of the following statements was true of the Homestead Strike.docxjolleybendicty
Which of the following statements was true of the Homestead Strike?
Answer
A. Carnegie had laid off a large number of workers, and that had triggered the strike.
B. During the strike, an anarchist assassinated Carnegie.
C. It took place at Carnegie's steel plant in Chicago.
D. Even guards from the famous Pinkerton Agency refused to take the job of entering the plant.
E. The state militia was sent in to allow strikebreakers to come in.
During the Civil War, Congress took advantage of the absence of southerners in the House and Senate to do all of the following, EXCEPT:
Answer
A. develop a national currency.
B. pass several national internal improvement projects.
C. authorize the construction of land grant universities.
D. support scientific training and research.
E. prohibit child labor.
General George Custer and his division were annihilated by a group of Sioux and Cheyenne warriors led by
Answer
A. Sitting Bull and Crazy Horse.
B. Chief Pontiac.
C. Tecumseh.
D. Nez Perce.
E. Chief Joseph.
Between 1860 and 1915, America's rail lines grew from 30,000 miles of track to more than
Answer
A. 100,000 miles.
B. 150,000 miles.
C. 200,000 miles.
D. 300,000 miles.
E. 250,000 miles.
The Chinese who settled in the West and became the victims of anti-Chinese sentiments had, in many cases, been recruited by Americans to
Answer
A. establish laundries in the new boomtowns of California.
B. help build the western portion of the Transcontinental Railroad.
C. help cultivate the Great Plains.
D. work as laborers and servants for the wealthy.
E. work as gold panners during the Gold Rush.
Andrew Carnegie's steel was used in which of the following American projects?
Answer
A. Statue of Liberty
B. Lincoln Monument
C. White House
D. Brooklyn Bridge
E. Transcontinental Railroad
The final act in the U.S. war against the Plains Indians took place at
Answer
A. the Canadian border.
B. Wounded Knee.
C. Pine Ridge.
D. Little Big Horn.
E. Sand Creek.
Abilene, Kansas was the nation's first "cow town" because
Answer
A. barbed wire was invented here.
B. Abilene city-bosses had lobbied Congress to become the nation's first town for cattle shipment.
C. most cowboys came from Kansas.
D. from here, cattle could be shipped by rail to meatpacking plants in Chicago.
E. the town had an old and established meatpacking tradition.
The entrepreneurs that served as the main stimulants of economic growth in the United States between 1865 and 1915 were all of the following, EXCEPT:
Answer
A. aggressive.
B. far-sighted.
C. incorruptible.
D. opportunistic.
E. innovative
The Transcontinental Railroad was completed in
Answer
A. 1877.
B. 1864.
C. 1873.
D. 1869.
E. 1859.
The person who cornered the market on oil refining in the late 1800s was
Answer
A. John D. Rockef.
Which of the following studies would require a scientist to have e.docxjolleybendicty
Which of the following studies would require a scientist to have extensive knowledge in geology, meteorology, and astronomy?
Save
Question 2
(1 point)
If a scientist is studying whether there are tornadoes on planet Venus, what areas of earth science are involved?
Save
Question 3
(1 point)
A scientist with extensive knowledge in the areas of astronomy and meteorology would be best suited to study which of the following?
Save
Subsection
Question 4
(1 point)
Oceanography formally began as a discipline in the 1800s with studies by
Save
Question 5
(1 point)
Which earth science area has its formal beginning in the 1800s with studies by Darwin, Cook, and Thompson?
Save
Question 6
(1 point)
Which earth science area was involved in producing the first calendars?
Save
Subsection
Question 7
(1 point)
A scientist who investigates how to generate electricity from the ocean's tides would most likely study
Save
Question 8
(1 point)
A scientist who examines dinosaur fossils to understand what they ate would most likely study
Save
Subsection
Question 9
(1 point)
Which planet is the appropriate distance from the Sun to have liquid water?
Save
Question 10
(1 point)
Which of the following is true concerning planet Earth?
Save
Subsection
Question 11
(1 point)
Which of the following is true concerning Venus?
Save
Question 12
(1 point)
Which of the following is one reason Venus can NOT sustain life?
Save
Question 13
(1 point)
What characteristic of Mars leads scientists to believe it may have once sustained life?
Save
Subsection
Question 14
(1 point)
Which of the following is NOT an example of technology in medicine?
Save
Question 15
(1 point)
Which of the following is an example of technology?
Save
Subsection
Question 16
(1 point)
Which of the following is true concerning technology?
Save
Question 17
(1 point)
Which of the following is an example of a positive effect of technology on childhood obesity?
Save
Subsection
Question 18
(1 point)
Which of the following statements is NOT true concerning the scientific method?
Save
Question 19
(1 point)
When you perform an experiment, you are completing which step of the scientific method?
Save
Question 20
(1 point)
Generally, the first step of the scientific method is
Save
Subsection
Question 21
(1 point)
A well-tested concept that explains a wide range of observations is known as a(n)
Save
Question 22
(1 point)
Which of the following is NOT true concerning laws?
Save
Question 23
(1 point)
Which of the following is true concerning scientific theories and laws?
Save
Subsection
Question 24
(1 point)
Which of the following is NOT true concerning models?
Save
Question 25
(1 point)
Which of the following is true concerning models?
Save
Subsection
Question 26
(1 point)
You have completed an experiment to test the hypothesis: "If plant growth is dependent on nitrogen, then plants given more nitr.
Which of the following occurred after the Civil WarAnswer.docxjolleybendicty
Which of the following occurred after the Civil War?
Answer
Plantation owners lost their free labor.
Southern infrastructure was left intact.
Plantations were given to the freed African-Americans.
none of the above
1 points
Question 2
Which of the following is a term given to farmers who rented land to farm?
Answer
tenant farmer
sharecropper
carpetbagger
both a and b
1 points
Question 3
The Freedman's Bureau was established by
Answer
the federal government.
state governments.
charity organizations.
churches.
1 points
Question 4
________ prior to the end of Reconstruction.
Answer
Northern support for reconstruction increased
The number of military troops increased in the South
White southern Democrats took control of state government
all of the above
1 points
Question 5
Whose Republican group wanted full equality for African-Americans after the Civil War?
Answer
Andrew Johnson
Rutherford Hayes
Abraham Lincoln
Charles Sumner
1 points
Question 6
The Transcontinental Railroad connected
Answer
Oregon and Washington, D.C.
Texas and Chicago.
New York and California.
Kansas and Utah.
1 points
Question 7
The Timber Culture Act gave land to setters who
Answer
cut down timber for homes.
planted trees on the land.
cleared land for industry.
none of the above
1 points
Question 8
A common use for sod by settlers in the Great Plains was to
Answer
build houses.
burn for fuel.
plant cotton.
none of the above
1 points
Question 9
Which of the following statements is true?
Answer
Most Native American families in the late 1800s were living on their own land under the Dawes Severalty Act.
Most Native Americans in the late 1800s died from disease.
Most Native Americans in the late 1800s were either dead or living on reservations.
none of the above
1 points
Question 10
Who built the Union Pacific track of the Transcontinental Railroad?
Answer
Leland Stanford
Thomas Durant
Cornelius Vanderbilt
John D. Rockefeller
1 points
Question 11
Where were the first factories built?
Answer
South America
Asia
Europe
Canada
1 points
Question 12
Select the statement below that is true.
Answer
Many girls worked in cotton mills to pay for their college education.
Many girls worked in cotton mills to get free schooling
Many girls worked in cotton mills to pay for a male family member's education
Many girls worked in cotton mills because there were no other opportunities for women.
1 points
Question 13
Patents were issued to
Answer
inventors.
manufacturers.
government employees.
laborers.
1 points
Question 14
In which type of system does supply and demand control price?
Answer
merchant economic sy.
Which of the following statements about bodhisattvas is true..docxjolleybendicty
Which of the following statements about bodhisattvas is true?
.aThey are rejected in Mahayana Buddhism
.bThey are laypeople in Theravada Buddhism
.cThey are enlightened beings who refrain from entering nirvana in order to save others.
.dThey are monks who failed to enter nirvana and are sentenced to work for the poor.
.
Which of the following statements about Mexican immigration to.docxjolleybendicty
Which of the following statements about Mexican immigration to the United States are accurate?
The flow of population from Mexico has not been stimulated by U.S. employers.
Mexican Americans continue to be treated as a colonized group as a result of the political and economic systems that were formed in the 19th century.
Discrimination toward Mexican immigrants declines as a sense of competition and threat between such immigrants and other racial and ethnic groups increases.
All of the above.
None of the above.
5 points
QUESTION 2
This key leader in the Chicano movement sought to protect the rights of migrant farm workers and advocated nonviolent protest, particularly the use of boycotts:
José Angel Guttiérrez.
Rodolfo Gonzalez.
Reies López Tijerina.
César Chávez.
None of the above.
5 points
QUESTION 3
Which of the following statements best describes research and data on Latino acculturation in the United States?
Second generation immigrants are more likely to speak English than their parents.
The majority of Hispanics speak Spanish only.
The majority of Hispanics speak English only or are bilingual.
Both A and B.
Both A and C.
5 points
QUESTION 4
Which of these characteristics demonstrates the third wave of mass immigration to the United States?
It began after 1965 as a result as a shift in U.S. immigration policy.
It is more diverse than previous waves of immigration.
While the number of immigrants arriving per year is higher than earlier waves of immigration, the percentage of immigrants that comprise the U.S. population is lower today than in the past.
All of the above.
None of the above.
5 points
QUESTION 5
This policy, passed in 2001, allows for long-term detention of suspects and more latitude for searches and surveillance and raised concerns about how to balance the need for public safety with individual civil liberties:
USA Patriot Act.
Executive Order 13769.
Muslim Ban.
Civil Rights Act.
All of the above.
5 points
QUESTION 6
According to sociologist Douglas Massey, which statement does NOT characterize differences between contemporary and historic assimilation patterns?
The ease and speed of modern modes of communication and transportation will maintain cultural and linguistic diversity.
Immigrants today face an economy and labor market similar to that experienced by Europeans immigrants in the late 19th and early 20th centuries.
Immigration today is continuous rather than cyclical.
All of the above.
None of the above.
5 points
QUESTION 7
You are a sociologist who is making an argument that traditional assimilation theory applies to recent immigrants. Which of the following statements would you include in your argument?
Contemporary assimilation will not follow the same course that it followed for European immigrants in the late 19th and early 20thcenturies.
Studies of acculturalization show that contemporary immigrants achieve Engl.
Which of the following statements is NOT true of an atomthat.docxjolleybendicty
Which of the following statements is NOT true of an atom
that it is composed of extremely small particles that are too small to be seen with an optical microscope and that size at the atomic level is measured on the nanoscale.
There are three basic particles in the atom (proton, neutron, and electron).
The Proton is Positive, the neutron is negative and the electron is neutral
The atom is the basic building block of all matter.
.
Which of the following is true in a monopolyA.)Business owner.docxjolleybendicty
Which of the following is true in a monopoly?
A.)Business owners should focus on pricing products correctly so customers will choose it over other products.
B.)Business owners should focus on other business functions, since advertising will not impact the success of their products.
C.)Business owners should use marketing to emphasize the unique features offered by their products.
D.)Business owners should bring their products to market quickly, before another company can create a similar product
This is the Passage for this question
1. Suppy and Demand
The law of demand in economic terms is defined as a downward sloping curve on a graph where price is the y-axis and quantity is the x-axis. What we're going to see is as price goes down, quantity sold increases. So, as a product becomes more available at a lower price, people will tend to want to buy more of it, and therefore, the quantity demanded will go up.
The law of supply, on the other hand, is the opposite story. As the price increases, more producers will want to get into the market, which will affect how much product will be available in the market, because more people are coming in and trying to make a profit on the current price. As price goes lower, the law of supply says that the quantity will also go down.
1a. Market Price and Equilibrium
Market price
is the current price of a good or service at which a customer is willing to pay. Let's put our supply and demand curves together on a graph, and set the market price at the point marked with the dot. This will represent, given the current situation, what a customer is willing to pay.
hint Keep in mind that these things are always in flux, so you'll never see them static, like they're represented here. This is just for the sake of demonstration.
Equilibrium price
is the price at which quantity demanded and quantity supplied will meet. Recall where we set our market price, the price at which a customer is willing to pay given the supply of a particular product. What's going to happen is that the lines will move around until equilibrium is met, as shown below.
This is the price, given the supply and demand curves, where price will be at an equilibrium, all other things being equal.
terms to know
Market Price The current price of a good or service which a customer is willing to pay Equilibrium Price The price at which quantity demanded and quantity supplied meet
1b. Surplus and Shortage
Surplus
is when there's more supply of a product than demand.
Shortage
is when there's more demand for a product than there is supply.
This is going to affect the price, obviously. Surpluses will mean lower prices, while shortages mean higher prices.
The size of a business is going to have an effect on how they can cope with surpluses and shortages. Larger organizations have more flex--more money--available, and they're able to look for more substitutions for a product than a smal.
Which of the following psychological perspectives is most likely to .docxjolleybendicty
Which of the following psychological perspectives is most likely to focus on the interrelations among the mind, body,
and behaviour?
a. the biological perspective
b. the cognitive perspective
c. the behavioural perspective
d. the evolutionary perspective
.
Which of the following is true a. Economics is the study of the .docxjolleybendicty
Which of the following is true?
a. Economics is the study of the choices we make among our many wants and desires, given our scarce resources.
b. In a world of scarcity, our unlimited wants exceed our limited resources.
c. Rational behavior involves doing the best you can, based on your values and information, under current and anticipated future circumstances.
d. Choices are costly because they require that we must give up other opportunities that we value.
e. All of the above are true.
.
Which of the following is the net requirement using an MRP program i.docxjolleybendicty
Which of the following is the net requirement using an MRP program if the gross requirement is 10,000 and the inventory on hand is 4,000?
·
[removed]
14,000
·
[removed]
4,000
·
[removed]
6,000
·
[removed]
10,000
2
Which of the following is a characteristic that can be used to guide the design of service systems?
·
[removed]
Quality work means quality service.
·
[removed]
Services cannot be inventoried.
·
[removed]
Services businesses are inherently entrepreneurial.
·
[removed]
Services are all similar.
Which of the following is considered a major process flow structure?
·
[removed]
Project
·
[removed]
Lead Time
·
[removed]
Lean Manufacturing
·
[removed]
Fabrication
4
Which of the following is an analytical tool used in Six-Sigma quality improvement programs?
·
[removed]
Pareto charts
·
[removed]
Pedigree charts
·
[removed]
Tree charts
·
[removed]
Gantt charts
5
Which of the following is ISO 14000 primarily concerned with?
·
[removed]
Time management
·
[removed]
Quality management
·
[removed]
Environmental management
·
[removed]
Continuous improvement management
6
Considering Hau Lee’s uncertainty framework for classifying supply chains, which of the following is given to a supply chain which has an evolving supply process based on functional products?
·
[removed]
Risk hedging
·
[removed]
Forward looking
·
[removed]
Agile
·
[removed]
Efficient
7
Which production process term best describes the situation when activities in a stage of production must stop because there is no work?
·
[removed]
Buffering
·
[removed]
Blocking
·
[removed]
Starving
·
[removed]
Staging
8
Which of the following is one of Dr. Eli Goldratt's rules of production scheduling for optimized production technology?
·
[removed]
If you lose an hour at a bottleneck it is better than making scrap.
·
[removed]
Utilization and activation of a resource are not the same.
·
[removed]
An hour saved at a bottleneck operation does not increase the process flow.
·
[removed]
Do not allow bottlenecks to govern the flow of the line.
9
Which of the following is considered an organizational blueprint, which prescribes the quantity and time frame for when each end product will be assembled?
·
[removed]
MPS (Master Production Schedule)
·
[removed]
ERP (Enterprise Resource Planning)
·
[removed]
MRP (Material Requirements Plan)
·
[removed]
WBS (Work Breakdown Structure)
10
There are many applications of poka-yokes in service organizations. Which of the following is one of the three-T's used to classify poka-yokes?
·
[removed]
Trust
·
[removed]
Time
·
[removed]
Teamwork
·
[removed]
Task
11
Which of the following is usually included as an inventory holding cost?
·
[removed]
Order placing
·
[removed]
Typing up an order
·
[removed]
Breakage
·
[removed]
Quantity discounts
12
Which of the following terms describes the time a unit spends actually being worked on together with the time spent waiting in a queue?
·
[removed]
Cycle time
·
[removed]
Flow time
·
[.
Which of the following is not a way managers generally benefit from .docxjolleybendicty
Which of the following is not a way managers generally benefit from acquisitions?
A.
Social prominence
B.
Shielding against risk
C.
Consolidation of other senior executives
D.
Increased compensation
E.
Political power
What measure, that depends on how much of a firm’s revenues are attributable to product market activities that have shared technological characteristics, production characteristics, or distribution channels, is used to determine how diversified a firm is at a given time?
A.
Relatedness
B.
Rumelt score
C.
Conglomerate level
D.
Integration level
E.
Activity share
Which of the following is not generally a potential benefit of diversification?
A.
Economies of scale and scope
B.
Control systems rewarding/penalizing division managers based on business unit objective
C.
Identifying undervalued firms
D.
Economizing on transaction costs
E.
Diversifying shareholder portfolios
Suppose the cost of producing a 30 second commercial for television is $100,000. If airtime on the evening news costs $200,000 and is viewed by 5 million people, what is the advertising cost per potential customer?
A.
$.02 per potential customer, or $2.00 per 1000 customers
B.
$.06 per potential customer, or $6.00 per 100 customers
C.
$.03 per potential customer, or $3.00 per 1000 customers
D.
$.04 per potential customer, or $4.00 per 1000 customers
E.
none of the above
.
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
-- WARNING All output lines starting with a double dash are there
1. -- WARNING: All output lines starting with a double dash are
there to show you
-- how the simulation proceeds and are NEITHER REQUIRED
NOR RECOMMENDED.
-- ARRIVAL event for process 3 at time 0 ms
Process 3 starts at time 0 ms
Process Table:
There are no active processes.
-- Process 3 requests a core at time 0 ms for 100 ms.
-- Process 3 will release a core at time 100 ms.
-- ARRIVAL event for process 5 at time 3 ms
Process 5 starts at time 3 ms
Process Table:
Process 3 is RUNNING.
-- Process 5 requests a core at time 3 ms for 120 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- ARRIVAL event for process 7 at time 5 ms
Process 7 starts at time 5 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
-- Process 7 requests a core at time 5 ms for 120 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
2. -- ARRIVAL event for process 9 at time 8 ms
Process 9 starts at time 8 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
Process 7 is READY.
-- Process 9 requests a core at time 8 ms for 100 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- ARRIVAL event for process 11 at time 13 ms
Process 11 starts at time 13 ms
Process Table:
Process 3 is RUNNING.
Process 5 is READY.
Process 7 is READY.
Process 9 is READY.
-- Process 11 requests a core at time 13 ms for 120 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 3 at time 100 ms
-- Process 5 will release a core at time 220 ms.
-- Process 3 requests SSD access at time 100 ms for 0 ms.
-- Process 3 will release the SSD at time 100 ms.
-- SSD completion event for process 3 at time 100 ms
-- Process 3 requests a core at time 100 ms for 80 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
3. -- CORE completion event for process 5 at time 220 ms
-- Process 7 will release a core at time 340 ms.
-- Process 5 requests SSD access at time 220 ms for 0 ms.
-- Process 5 will release the SSD at time 220 ms.
-- SSD completion event for process 5 at time 220 ms
-- Process 5 requests a core at time 220 ms for 60 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 7 at time 340 ms
-- Process 9 will release a core at time 440 ms.
-- Process 7 requests SSD access at time 340 ms for 0 ms.
-- Process 7 will release the SSD at time 340 ms.
-- SSD completion event for process 7 at time 340 ms
-- Process 7 requests a core at time 340 ms for 60 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 9 at time 440 ms
-- Process 11 will release a core at time 560 ms.
-- Process 9 requests SSD access at time 440 ms for 0 ms.
-- Process 9 will release the SSD at time 440 ms.
-- SSD completion event for process 9 at time 440 ms
-- Process 9 requests a core at time 440 ms for 80 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 11 at time 560 ms
-- Process 3 will release a core at time 640 ms.
-- Process 11 requests SSD access at time 560 ms for 0 ms.
-- Process 11 will release the SSD at time 560 ms.
-- SSD completion event for process 11 at time 560 ms
4. -- Process 11 requests a core at time 560 ms for 60 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 3 at time 640 ms
-- Process 5 will release a core at time 700 ms.
-- Process 3 requests SSD access at time 640 ms for 0 ms.
-- Process 3 will release the SSD at time 640 ms.
-- SSD completion event for process 3 at time 640 ms
-- Process 3 requests a core at time 640 ms for 40 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 5 at time 700 ms
-- Process 7 will release a core at time 760 ms.
-- Process 5 requests SSD access at time 700 ms for 0 ms.
-- Process 5 will release the SSD at time 700 ms.
-- SSD completion event for process 5 at time 700 ms
-- Process 5 requests a core at time 700 ms for 20 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 7 at time 760 ms
-- Process 9 will release a core at time 840 ms.
-- Process 7 requests SSD access at time 760 ms for 0 ms.
-- Process 7 will release the SSD at time 760 ms.
-- SSD completion event for process 7 at time 760 ms
-- Process 7 requests a core at time 760 ms for 20 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 9 at time 840 ms
-- Process 11 will release a core at time 900 ms.
5. -- Process 9 requests SSD access at time 840 ms for 0 ms.
-- Process 9 will release the SSD at time 840 ms.
-- SSD completion event for process 9 at time 840 ms
-- Process 9 requests a core at time 840 ms for 40 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 11 at time 900 ms
-- Process 3 will release a core at time 940 ms.
-- Process 11 requests SSD access at time 900 ms for 0 ms.
-- Process 11 will release the SSD at time 900 ms.
-- SSD completion event for process 11 at time 900 ms
-- Process 11 requests a core at time 900 ms for 20 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 3 at time 940 ms
-- Process 5 will release a core at time 960 ms.
-- Process 3 requests SSD access at time 940 ms for 0 ms.
-- Process 3 will release the SSD at time 940 ms.
-- SSD completion event for process 3 at time 940 ms
-- Process 3 requests a core at time 940 ms for 80 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 5 at time 960 ms
-- Process 7 will release a core at time 980 ms.
-- Process 5 requests SSD access at time 960 ms for 0 ms.
-- Process 5 will release the SSD at time 960 ms.
-- SSD completion event for process 5 at time 960 ms
-- Process 5 requests a core at time 960 ms for 30 ms.
-- Process 5 must wait for a core.
6. -- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 7 at time 980 ms
-- Process 9 will release a core at time 1020 ms.
-- Process 7 requests SSD access at time 980 ms for 0 ms.
-- Process 7 will release the SSD at time 980 ms.
-- SSD completion event for process 7 at time 980 ms
-- Process 7 requests a core at time 980 ms for 30 ms.
-- Process 7 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 9 at time 1020 ms
-- Process 11 will release a core at time 1040 ms.
-- Process 9 requests SSD access at time 1020 ms for 0 ms.
-- Process 9 will release the SSD at time 1020 ms.
-- SSD completion event for process 9 at time 1020 ms
-- Process 9 requests a core at time 1020 ms for 70 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 11 at time 1040 ms
-- Process 3 will release a core at time 1120 ms.
-- Process 11 requests SSD access at time 1040 ms for 0 ms.
-- Process 11 will release the SSD at time 1040 ms.
-- SSD completion event for process 11 at time 1040 ms
-- Process 11 requests a core at time 1040 ms for 30 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 3 at time 1120 ms
-- Process 5 will release a core at time 1150 ms.
-- Process 3 requests SSD access at time 1120 ms for 0 ms.
-- Process 3 will release the SSD at time 1120 ms.
7. -- SSD completion event for process 3 at time 1120 ms
-- Process 3 requests a core at time 1120 ms for 40 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 5 at time 1150 ms
-- Process 7 will release a core at time 1180 ms.
-- Process 5 requests SSD access at time 1150 ms for 0 ms.
-- Process 5 will release the SSD at time 1150 ms.
-- SSD completion event for process 5 at time 1150 ms
-- Process 5 requests a core at time 1150 ms for 80 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 4 process(es) waiting for a core.
-- CORE completion event for process 7 at time 1180 ms
-- Process 9 will release a core at time 1250 ms.
Process 7 terminates at time 1180 ms.
Process Table:
Process 3 is READY.
Process 5 is READY.
Process 7 is TERMINATED.
Process 9 is RUNNING.
Process 11 is READY.
-- CORE completion event for process 9 at time 1250 ms
-- Process 11 will release a core at time 1280 ms.
-- Process 9 requests SSD access at time 1250 ms for 0 ms.
-- Process 9 will release the SSD at time 1250 ms.
-- SSD completion event for process 9 at time 1250 ms
-- Process 9 requests a core at time 1250 ms for 80 ms.
-- Process 9 must wait for a core.
8. -- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 11 at time 1280 ms
-- Process 3 will release a core at time 1320 ms.
-- Process 11 requests SSD access at time 1280 ms for 0 ms.
-- Process 11 will release the SSD at time 1280 ms.
-- SSD completion event for process 11 at time 1280 ms
-- Process 11 requests a core at time 1280 ms for 80 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 3 at time 1320 ms
-- Process 5 will release a core at time 1400 ms.
-- Process 3 requests SSD access at time 1320 ms for 0 ms.
-- Process 3 will release the SSD at time 1320 ms.
-- SSD completion event for process 3 at time 1320 ms
-- Process 3 requests a core at time 1320 ms for 90 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 5 at time 1400 ms
-- Process 9 will release a core at time 1480 ms.
-- Process 5 requests SSD access at time 1400 ms for 0 ms.
-- Process 5 will release the SSD at time 1400 ms.
-- SSD completion event for process 5 at time 1400 ms
-- Process 5 requests a core at time 1400 ms for 80 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 9 at time 1480 ms
-- Process 11 will release a core at time 1560 ms.
-- Process 9 requests SSD access at time 1480 ms for 0 ms.
-- Process 9 will release the SSD at time 1480 ms.
9. -- SSD completion event for process 9 at time 1480 ms
-- Process 9 requests a core at time 1480 ms for 40 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 11 at time 1560 ms
-- Process 3 will release a core at time 1650 ms.
-- Process 11 requests SSD access at time 1560 ms for 0 ms.
-- Process 11 will release the SSD at time 1560 ms.
-- SSD completion event for process 11 at time 1560 ms
-- Process 11 requests a core at time 1560 ms for 60 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 3 at time 1650 ms
-- Process 5 will release a core at time 1730 ms.
-- Process 3 requests SSD access at time 1650 ms for 1 ms.
-- Process 3 will release the SSD at time 1651 ms.
-- SSD completion event for process 3 at time 1651 ms
-- Process 3 requests a core at time 1651 ms for 100 ms.
-- Process 3 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 5 at time 1730 ms
-- Process 9 will release a core at time 1770 ms.
-- Process 5 requests SSD access at time 1730 ms for 0 ms.
-- Process 5 will release the SSD at time 1730 ms.
-- SSD completion event for process 5 at time 1730 ms
-- Process 5 requests a core at time 1730 ms for 40 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
10. -- CORE completion event for process 9 at time 1770 ms
-- Process 11 will release a core at time 1830 ms.
-- Process 9 requests SSD access at time 1770 ms for 0 ms.
-- Process 9 will release the SSD at time 1770 ms.
-- SSD completion event for process 9 at time 1770 ms
-- Process 9 requests a core at time 1770 ms for 90 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 11 at time 1830 ms
-- Process 3 will release a core at time 1930 ms.
-- Process 11 requests SSD access at time 1830 ms for 0 ms.
-- Process 11 will release the SSD at time 1830 ms.
-- SSD completion event for process 11 at time 1830 ms
-- Process 11 requests a core at time 1830 ms for 20 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 3 process(es) waiting for a core.
-- CORE completion event for process 3 at time 1930 ms
-- Process 5 will release a core at time 1970 ms.
-- Process 3 will interact with a user at time 1930 ms for 5000
ms.
-- Process 3 will complete the interaction at time 6930 ms.
-- CORE completion event for process 5 at time 1970 ms
-- Process 9 will release a core at time 2060 ms.
-- Process 5 requests SSD access at time 1970 ms for 0 ms.
-- Process 5 will release the SSD at time 1970 ms.
-- SSD completion event for process 5 at time 1970 ms
-- Process 5 requests a core at time 1970 ms for 80 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
11. -- CORE completion event for process 9 at time 2060 ms
-- Process 11 will release a core at time 2080 ms.
-- Process 9 requests SSD access at time 2060 ms for 0 ms.
-- Process 9 will release the SSD at time 2060 ms.
-- SSD completion event for process 9 at time 2060 ms
-- Process 9 requests a core at time 2060 ms for 80 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 2080 ms
-- Process 5 will release a core at time 2160 ms.
-- Process 11 requests SSD access at time 2080 ms for 0 ms.
-- Process 11 will release the SSD at time 2080 ms.
-- SSD completion event for process 11 at time 2080 ms
-- Process 11 requests a core at time 2080 ms for 30 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 2160 ms
-- Process 9 will release a core at time 2240 ms.
-- Process 5 requests SSD access at time 2160 ms for 0 ms.
-- Process 5 will release the SSD at time 2160 ms.
-- SSD completion event for process 5 at time 2160 ms
-- Process 5 requests a core at time 2160 ms for 40 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 2240 ms
-- Process 11 will release a core at time 2270 ms.
-- Process 9 requests SSD access at time 2240 ms for 0 ms.
-- Process 9 will release the SSD at time 2240 ms.
-- SSD completion event for process 9 at time 2240 ms
12. -- Process 9 requests a core at time 2240 ms for 40 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 2270 ms
-- Process 5 will release a core at time 2310 ms.
-- Process 11 requests SSD access at time 2270 ms for 0 ms.
-- Process 11 will release the SSD at time 2270 ms.
-- SSD completion event for process 11 at time 2270 ms
-- Process 11 requests a core at time 2270 ms for 80 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 2310 ms
-- Process 9 will release a core at time 2350 ms.
-- Process 5 requests SSD access at time 2310 ms for 0 ms.
-- Process 5 will release the SSD at time 2310 ms.
-- SSD completion event for process 5 at time 2310 ms
-- Process 5 requests a core at time 2310 ms for 90 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 2350 ms
-- Process 11 will release a core at time 2430 ms.
-- Process 9 requests SSD access at time 2350 ms for 0 ms.
-- Process 9 will release the SSD at time 2350 ms.
-- SSD completion event for process 9 at time 2350 ms
-- Process 9 requests a core at time 2350 ms for 90 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 2430 ms
-- Process 5 will release a core at time 2520 ms.
13. -- Process 11 requests SSD access at time 2430 ms for 0 ms.
-- Process 11 will release the SSD at time 2430 ms.
-- SSD completion event for process 11 at time 2430 ms
-- Process 11 requests a core at time 2430 ms for 80 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 2520 ms
-- Process 9 will release a core at time 2610 ms.
-- Process 5 requests SSD access at time 2520 ms for 0 ms.
-- Process 5 will release the SSD at time 2520 ms.
-- SSD completion event for process 5 at time 2520 ms
-- Process 5 requests a core at time 2520 ms for 80 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 2610 ms
-- Process 11 will release a core at time 2690 ms.
-- Process 9 requests SSD access at time 2610 ms for 1 ms.
-- Process 9 will release the SSD at time 2611 ms.
-- SSD completion event for process 9 at time 2611 ms
-- Process 9 requests a core at time 2611 ms for 110 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 2690 ms
-- Process 5 will release a core at time 2770 ms.
-- Process 11 requests SSD access at time 2690 ms for 0 ms.
-- Process 11 will release the SSD at time 2690 ms.
-- SSD completion event for process 11 at time 2690 ms
-- Process 11 requests a core at time 2690 ms for 40 ms.
-- Process 11 must wait for a core.
14. -- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 2770 ms
-- Process 9 will release a core at time 2880 ms.
-- Process 5 requests SSD access at time 2770 ms for 0 ms.
-- Process 5 will release the SSD at time 2770 ms.
-- SSD completion event for process 5 at time 2770 ms
-- Process 5 requests a core at time 2770 ms for 40 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 2880 ms
-- Process 11 will release a core at time 2920 ms.
-- Process 9 requests SSD access at time 2880 ms for 0 ms.
-- Process 9 will release the SSD at time 2880 ms.
-- SSD completion event for process 9 at time 2880 ms
-- Process 9 requests a core at time 2880 ms for 40 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 2920 ms
-- Process 5 will release a core at time 2960 ms.
-- Process 11 requests SSD access at time 2920 ms for 0 ms.
-- Process 11 will release the SSD at time 2920 ms.
-- SSD completion event for process 11 at time 2920 ms
-- Process 11 requests a core at time 2920 ms for 80 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 2960 ms
-- Process 9 will release a core at time 3000 ms.
-- Process 5 requests SSD access at time 2960 ms for 0 ms.
-- Process 5 will release the SSD at time 2960 ms.
15. -- SSD completion event for process 5 at time 2960 ms
-- Process 5 requests a core at time 2960 ms for 90 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 3000 ms
-- Process 11 will release a core at time 3080 ms.
-- Process 9 requests SSD access at time 3000 ms for 0 ms.
-- Process 9 will release the SSD at time 3000 ms.
-- SSD completion event for process 9 at time 3000 ms
-- Process 9 requests a core at time 3000 ms for 90 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 3080 ms
-- Process 5 will release a core at time 3170 ms.
-- Process 11 requests SSD access at time 3080 ms for 0 ms.
-- Process 11 will release the SSD at time 3080 ms.
-- SSD completion event for process 11 at time 3080 ms
-- Process 11 requests a core at time 3080 ms for 40 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 3170 ms
-- Process 9 will release a core at time 3260 ms.
-- Process 5 requests SSD access at time 3170 ms for 1 ms.
-- Process 5 will release the SSD at time 3171 ms.
-- SSD completion event for process 5 at time 3171 ms
-- Process 5 requests a core at time 3171 ms for 100 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
16. -- CORE completion event for process 9 at time 3260 ms
-- Process 11 will release a core at time 3300 ms.
-- Process 9 requests SSD access at time 3260 ms for 1 ms.
-- Process 9 will release the SSD at time 3261 ms.
-- SSD completion event for process 9 at time 3261 ms
-- Process 9 requests a core at time 3261 ms for 100 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 3300 ms
-- Process 5 will release a core at time 3400 ms.
-- Process 11 requests SSD access at time 3300 ms for 0 ms.
-- Process 11 will release the SSD at time 3300 ms.
-- SSD completion event for process 11 at time 3300 ms
-- Process 11 requests a core at time 3300 ms for 90 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 3400 ms
-- Process 9 will release a core at time 3500 ms.
-- Process 5 will interact with a user at time 3400 ms for 5000
ms.
-- Process 5 will complete the interaction at time 8400 ms.
-- CORE completion event for process 9 at time 3500 ms
-- Process 11 will release a core at time 3590 ms.
-- Process 9 will interact with a user at time 3500 ms for 3000
ms.
-- Process 9 will complete the interaction at time 6500 ms.
-- CORE completion event for process 11 at time 3590 ms
-- Process 11 requests SSD access at time 3590 ms for 0 ms.
-- Process 11 will release the SSD at time 3590 ms.
17. -- SSD completion event for process 11 at time 3590 ms
-- Process 11 requests a core at time 3590 ms for 80 ms.
-- Process 11 will release a core at time 3670 ms.
-- CORE completion event for process 11 at time 3670 ms
-- Process 11 requests SSD access at time 3670 ms for 0 ms.
-- Process 11 will release the SSD at time 3670 ms.
-- SSD completion event for process 11 at time 3670 ms
-- Process 11 requests a core at time 3670 ms for 40 ms.
-- Process 11 will release a core at time 3710 ms.
-- CORE completion event for process 11 at time 3710 ms
-- Process 11 requests SSD access at time 3710 ms for 0 ms.
-- Process 11 will release the SSD at time 3710 ms.
-- SSD completion event for process 11 at time 3710 ms
-- Process 11 requests a core at time 3710 ms for 90 ms.
-- Process 11 will release a core at time 3800 ms.
-- CORE completion event for process 11 at time 3800 ms
-- Process 11 requests SSD access at time 3800 ms for 1 ms.
-- Process 11 will release the SSD at time 3801 ms.
-- SSD completion event for process 11 at time 3801 ms
-- Process 11 requests a core at time 3801 ms for 100 ms.
-- Process 11 will release a core at time 3901 ms.
-- CORE completion event for process 11 at time 3901 ms
-- Process 11 will interact with a user at time 3901 ms for 5000
ms.
-- Process 11 will complete the interaction at time 8901 ms.
-- TTY completion event for process 9 at time 6500 ms
-- Process 9 requests a core at time 6500 ms for 120 ms.
-- Process 9 will release a core at time 6620 ms.
18. -- CORE completion event for process 9 at time 6620 ms
-- Process 9 will interact with a user at time 6620 ms for 2000
ms.
-- Process 9 will complete the interaction at time 8620 ms.
-- TTY completion event for process 3 at time 6930 ms
-- Process 3 requests a core at time 6930 ms for 20 ms.
-- Process 3 will release a core at time 6950 ms.
-- CORE completion event for process 3 at time 6950 ms
-- Process 3 will interact with a user at time 6950 ms for 5000
ms.
-- Process 3 will complete the interaction at time 11950 ms.
-- TTY completion event for process 5 at time 8400 ms
-- Process 5 requests a core at time 8400 ms for 80 ms.
-- Process 5 will release a core at time 8480 ms.
-- CORE completion event for process 5 at time 8480 ms
-- Process 5 requests SSD access at time 8480 ms for 0 ms.
-- Process 5 will release the SSD at time 8480 ms.
-- SSD completion event for process 5 at time 8480 ms
-- Process 5 requests a core at time 8480 ms for 80 ms.
-- Process 5 will release a core at time 8560 ms.
-- CORE completion event for process 5 at time 8560 ms
-- Process 5 requests SSD access at time 8560 ms for 0 ms.
-- Process 5 will release the SSD at time 8560 ms.
-- SSD completion event for process 5 at time 8560 ms
-- Process 5 requests a core at time 8560 ms for 40 ms.
-- Process 5 will release a core at time 8600 ms.
-- CORE completion event for process 5 at time 8600 ms
19. -- Process 5 requests SSD access at time 8600 ms for 0 ms.
-- Process 5 will release the SSD at time 8600 ms.
-- SSD completion event for process 5 at time 8600 ms
-- Process 5 requests a core at time 8600 ms for 90 ms.
-- Process 5 will release a core at time 8690 ms.
-- TTY completion event for process 9 at time 8620 ms
-- Process 9 requests a core at time 8620 ms for 80 ms.
-- Process 9 must wait for a core.
-- I Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 5 at time 8690 ms
-- Process 9 will release a core at time 8770 ms.
-- Process 5 requests SSD access at time 8690 ms for 1 ms.
-- Process 5 will release the SSD at time 8691 ms.
-- SSD completion event for process 5 at time 8691 ms
-- Process 5 requests a core at time 8691 ms for 30 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 9 at time 8770 ms
-- Process 5 will release a core at time 8800 ms.
-- Process 9 requests SSD access at time 8770 ms for 1 ms.
-- Process 9 will release the SSD at time 8771 ms.
-- SSD completion event for process 9 at time 8771 ms
-- Process 9 requests a core at time 8771 ms for 30 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 5 at time 8800 ms
-- Process 9 will release a core at time 8830 ms.
-- Process 5 requests SSD access at time 8800 ms for 1 ms.
-- Process 5 will release the SSD at time 8801 ms.
20. -- SSD completion event for process 5 at time 8801 ms
-- Process 5 requests a core at time 8801 ms for 20 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 9 at time 8830 ms
-- Process 5 will release a core at time 8850 ms.
-- Process 9 requests SSD access at time 8830 ms for 1 ms.
-- Process 9 will release the SSD at time 8831 ms.
-- SSD completion event for process 9 at time 8831 ms
-- Process 9 requests a core at time 8831 ms for 20 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 5 at time 8850 ms
-- Process 9 will release a core at time 8870 ms.
-- Process 5 requests SSD access at time 8850 ms for 1 ms.
-- Process 5 will release the SSD at time 8851 ms.
-- SSD completion event for process 5 at time 8851 ms
-- Process 5 requests a core at time 8851 ms for 30 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 9 at time 8870 ms
-- Process 5 will release a core at time 8900 ms.
-- Process 9 requests SSD access at time 8870 ms for 1 ms.
-- Process 9 will release the SSD at time 8871 ms.
-- SSD completion event for process 9 at time 8871 ms
-- Process 9 requests a core at time 8871 ms for 30 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
21. -- CORE completion event for process 5 at time 8900 ms
-- Process 9 will release a core at time 8930 ms.
-- Process 5 requests SSD access at time 8900 ms for 1 ms.
-- Process 5 will release the SSD at time 8901 ms.
-- SSD completion event for process 5 at time 8901 ms
-- Process 5 requests a core at time 8901 ms for 20 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 1 process(es) waiting for a core.
-- TTY completion event for process 11 at time 8901 ms
-- Process 11 requests a core at time 8901 ms for 80 ms.
-- Process 11 must wait for a core.
-- I Queue now contains 1 process(es) waiting for a core.
-- CORE completion event for process 9 at time 8930 ms
-- Process 11 will release a core at time 9010 ms.
-- Process 9 requests SSD access at time 8930 ms for 1 ms.
-- Process 9 will release the SSD at time 8931 ms.
-- SSD completion event for process 9 at time 8931 ms
-- Process 9 requests a core at time 8931 ms for 20 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 9010 ms
-- Process 5 will release a core at time 9030 ms.
-- Process 11 requests SSD access at time 9010 ms for 0 ms.
-- Process 11 will release the SSD at time 9010 ms.
-- SSD completion event for process 11 at time 9010 ms
-- Process 11 requests a core at time 9010 ms for 80 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 9030 ms
22. -- Process 9 will release a core at time 9050 ms.
-- Process 5 requests SSD access at time 9030 ms for 1 ms.
-- Process 5 will release the SSD at time 9031 ms.
-- SSD completion event for process 5 at time 9031 ms
-- Process 5 requests a core at time 9031 ms for 30 ms.
-- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 9050 ms
-- Process 11 will release a core at time 9130 ms.
-- Process 9 requests SSD access at time 9050 ms for 1 ms.
-- Process 9 will release the SSD at time 9051 ms.
-- SSD completion event for process 9 at time 9051 ms
-- Process 9 requests a core at time 9051 ms for 30 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 9130 ms
-- Process 5 will release a core at time 9160 ms.
-- Process 11 requests SSD access at time 9130 ms for 0 ms.
-- Process 11 will release the SSD at time 9130 ms.
-- SSD completion event for process 11 at time 9130 ms
-- Process 11 requests a core at time 9130 ms for 40 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 9160 ms
-- Process 9 will release a core at time 9190 ms.
-- Process 5 requests SSD access at time 9160 ms for 1 ms.
-- Process 5 will release the SSD at time 9161 ms.
-- SSD completion event for process 5 at time 9161 ms
-- Process 5 requests a core at time 9161 ms for 20 ms.
23. -- Process 5 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 9 at time 9190 ms
-- Process 11 will release a core at time 9230 ms.
-- Process 9 requests SSD access at time 9190 ms for 1 ms.
-- Process 9 will release the SSD at time 9191 ms.
-- SSD completion event for process 9 at time 9191 ms
-- Process 9 requests a core at time 9191 ms for 20 ms.
-- Process 9 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 11 at time 9230 ms
-- Process 5 will release a core at time 9250 ms.
-- Process 11 requests SSD access at time 9230 ms for 0 ms.
-- Process 11 will release the SSD at time 9230 ms.
-- SSD completion event for process 11 at time 9230 ms
-- Process 11 requests a core at time 9230 ms for 90 ms.
-- Process 11 must wait for a core.
-- NI Queue now contains 2 process(es) waiting for a core.
-- CORE completion event for process 5 at time 9250 ms
-- Process 9 will release a core at time 9270 ms.
Process 5 terminates at time 9250 ms.
Process Table:
Process 3 is BLOCKED.
Process 5 is TERMINATED.
Process 9 is RUNNING.
Process 11 is READY.
-- CORE completion event for process 9 at time 9270 ms
-- Process 11 will release a core at time 9360 ms.
24. Process 9 terminates at time 9270 ms.
Process Table:
Process 3 is BLOCKED.
Process 9 is TERMINATED.
Process 11 is RUNNING.
-- CORE completion event for process 11 at time 9360 ms
-- Process 11 requests SSD access at time 9360 ms for 1 ms.
-- Process 11 will release the SSD at time 9361 ms.
-- SSD completion event for process 11 at time 9361 ms
-- Process 11 requests a core at time 9361 ms for 30 ms.
-- Process 11 will release a core at time 9391 ms.
-- CORE completion event for process 11 at time 9391 ms
-- Process 11 requests SSD access at time 9391 ms for 1 ms.
-- Process 11 will release the SSD at time 9392 ms.
-- SSD completion event for process 11 at time 9392 ms
-- Process 11 requests a core at time 9392 ms for 20 ms.
-- Process 11 will release a core at time 9412 ms.
-- CORE completion event for process 11 at time 9412 ms
-- Process 11 requests SSD access at time 9412 ms for 1 ms.
-- Process 11 will release the SSD at time 9413 ms.
-- SSD completion event for process 11 at time 9413 ms
-- Process 11 requests a core at time 9413 ms for 30 ms.
-- Process 11 will release a core at time 9443 ms.
-- CORE completion event for process 11 at time 9443 ms
-- Process 11 requests SSD access at time 9443 ms for 0 ms.
-- Process 11 will release the SSD at time 9443 ms.
25. -- SSD completion event for process 11 at time 9443 ms
-- Process 11 requests a core at time 9443 ms for 90 ms.
-- Process 11 will release a core at time 9533 ms.
-- CORE completion event for process 11 at time 9533 ms
-- Process 11 requests SSD access at time 9533 ms for 1 ms.
-- Process 11 will release the SSD at time 9534 ms.
-- SSD completion event for process 11 at time 9534 ms
-- Process 11 requests a core at time 9534 ms for 30 ms.
-- Process 11 will release a core at time 9564 ms.
-- CORE completion event for process 11 at time 9564 ms
-- Process 11 requests SSD access at time 9564 ms for 1 ms.
-- Process 11 will release the SSD at time 9565 ms.
-- SSD completion event for process 11 at time 9565 ms
-- Process 11 requests a core at time 9565 ms for 20 ms.
-- Process 11 will release a core at time 9585 ms.
-- CORE completion event for process 11 at time 9585 ms
-- Process 11 requests SSD access at time 9585 ms for 1 ms.
-- Process 11 will release the SSD at time 9586 ms.
-- SSD completion event for process 11 at time 9586 ms
-- Process 11 requests a core at time 9586 ms for 30 ms.
-- Process 11 will release a core at time 9616 ms.
-- CORE completion event for process 11 at time 9616 ms
-- Process 11 requests SSD access at time 9616 ms for 1 ms.
-- Process 11 will release the SSD at time 9617 ms.
-- SSD completion event for process 11 at time 9617 ms
-- Process 11 requests a core at time 9617 ms for 20 ms.
-- Process 11 will release a core at time 9637 ms.
26. -- CORE completion event for process 11 at time 9637 ms
-- Process 11 requests SSD access at time 9637 ms for 1 ms.
-- Process 11 will release the SSD at time 9638 ms.
-- SSD completion event for process 11 at time 9638 ms
-- Process 11 requests a core at time 9638 ms for 30 ms.
-- Process 11 will release a core at time 9668 ms.
-- CORE completion event for process 11 at time 9668 ms
-- Process 11 requests SSD access at time 9668 ms for 1 ms.
-- Process 11 will release the SSD at time 9669 ms.
-- SSD completion event for process 11 at time 9669 ms
-- Process 11 requests a core at time 9669 ms for 20 ms.
-- Process 11 will release a core at time 9689 ms.
-- CORE completion event for process 11 at time 9689 ms
Process 11 terminates at time 9689 ms.
Process Table:
Process 3 is BLOCKED.
Process 11 is TERMINATED.
-- TTY completion event for process 3 at time 11950 ms
-- Process 3 requests a core at time 11950 ms for 80 ms.
-- Process 3 will release a core at time 12030 ms.
-- CORE completion event for process 3 at time 12030 ms
-- Process 3 requests SSD access at time 12030 ms for 1 ms.
-- Process 3 will release the SSD at time 12031 ms.
-- SSD completion event for process 3 at time 12031 ms
-- Process 3 requests a core at time 12031 ms for 30 ms.
-- Process 3 will release a core at time 12061 ms.
27. -- CORE completion event for process 3 at time 12061 ms
-- Process 3 requests SSD access at time 12061 ms for 0 ms.
-- Process 3 will release the SSD at time 12061 ms.
-- SSD completion event for process 3 at time 12061 ms
-- Process 3 requests a core at time 12061 ms for 90 ms.
-- Process 3 will release a core at time 12151 ms.
-- CORE completion event for process 3 at time 12151 ms
-- Process 3 requests SSD access at time 12151 ms for 1 ms.
-- Process 3 will release the SSD at time 12152 ms.
-- SSD completion event for process 3 at time 12152 ms
-- Process 3 requests a core at time 12152 ms for 30 ms.
-- Process 3 will release a core at time 12182 ms.
-- CORE completion event for process 3 at time 12182 ms
-- Process 3 requests SSD access at time 12182 ms for 1 ms.
-- Process 3 will release the SSD at time 12183 ms.
-- SSD completion event for process 3 at time 12183 ms
-- Process 3 requests a core at time 12183 ms for 20 ms.
-- Process 3 will release a core at time 12203 ms.
-- CORE completion event for process 3 at time 12203 ms
-- Process 3 requests SSD access at time 12203 ms for 1 ms.
-- Process 3 will release the SSD at time 12204 ms.
-- SSD completion event for process 3 at time 12204 ms
-- Process 3 requests a core at time 12204 ms for 30 ms.
-- Process 3 will release a core at time 12234 ms.
-- CORE completion event for process 3 at time 12234 ms
-- Process 3 requests SSD access at time 12234 ms for 1 ms.
-- Process 3 will release the SSD at time 12235 ms.
28. -- SSD completion event for process 3 at time 12235 ms
-- Process 3 requests a core at time 12235 ms for 20 ms.
-- Process 3 will release a core at time 12255 ms.
-- CORE completion event for process 3 at time 12255 ms
-- Process 3 requests SSD access at time 12255 ms for 1 ms.
-- Process 3 will release the SSD at time 12256 ms.
-- SSD completion event for process 3 at time 12256 ms
-- Process 3 requests a core at time 12256 ms for 30 ms.
-- Process 3 will release a core at time 12286 ms.
-- CORE completion event for process 3 at time 12286 ms
-- Process 3 requests SSD access at time 12286 ms for 1 ms.
-- Process 3 will release the SSD at time 12287 ms.
-- SSD completion event for process 3 at time 12287 ms
-- Process 3 requests a core at time 12287 ms for 20 ms.
-- Process 3 will release a core at time 12307 ms.
-- CORE completion event for process 3 at time 12307 ms
-- Process 3 requests SSD access at time 12307 ms for 1 ms.
-- Process 3 will release the SSD at time 12308 ms.
-- SSD completion event for process 3 at time 12308 ms
-- Process 3 requests a core at time 12308 ms for 30 ms.
-- Process 3 will release a core at time 12338 ms.
-- CORE completion event for process 3 at time 12338 ms
-- Process 3 requests SSD access at time 12338 ms for 1 ms.
-- Process 3 will release the SSD at time 12339 ms.
-- SSD completion event for process 3 at time 12339 ms
-- Process 3 requests a core at time 12339 ms for 20 ms.
-- Process 3 will release a core at time 12359 ms.
29. -- CORE completion event for process 3 at time 12359 ms
Process 3 terminates at time 12359 ms.
Process Table:
Process 3 is TERMINATED.
SUMMARY:
Total elapsed time: 12359 ms
Number of processes that completed: 5
Total number of SSD accesses: 90
Average number of busy cores: 0.463
SSD utilization: 0.00
-- ARRIVAL event for process 0 at time 10 ms
Process 0 starts at time 10 ms
-- Process 0 requests a core at time 10 ms for 100 ms
-- Process 0 will release a core at time 110 ms
-- ARRIVAL event for process 1 at time 20 ms
Process 1 starts at time 20 ms
Process 0 is RUNNING
30. -- Process 1 requests a core at time 20 ms for 40 ms
-- Process 1 will release a core at time 60 ms
-- ARRIVAL event for process 2 at time 50 ms
Process 2 starts at time 50 ms
Process 0 is RUNNING
Process 1 is RUNNING
-- Process 2 requests a core at time 50 ms for 40 ms
-- Process 2 must wait for a core
-- Ready queue now contains 1 process(es) waiting for a core
-- ARRIVAL event for process 3 at time 60 ms
Process 3 starts at time 60 ms
Process 0 is RUNNING
Process 1 is RUNNING
Process 2 is READY
31. -- Process 3 requests a core at time 60 ms for 40 ms
-- Process 3 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 1 at time 60 ms
-- Process 2 will release a core at time 100 ms
-- Process 1 requests SSD access at time 60 ms for 1 ms
-- Process 1 will release the SSD at time 61 ms
-- SSD completion event for process 1 at time 61 ms
-- Process 1 requests a core at time 61 ms for 100 ms
-- Process 1 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- ARRIVAL event for process 4 at time 80 ms
Process 4 starts at time 80 ms
Process 0 is RUNNING
Process 1 is READY
Process 2 is RUNNING
Process 3 is READY
32. -- Process 4 requests a core at time 80 ms for 40 ms
-- Process 4 must wait for a core
-- Ready queue now contains 3 process(es) waiting for a core
-- CORE completion event for process 2 at time 100 ms
-- Process 3 will release a core at time 140 ms
-- Process 2 requests SSD access at time 100 ms for 1 ms
-- Process 2 will release the SSD at time 101 ms
-- SSD completion event for process 2 at time 101 ms
-- Process 2 requests a core at time 101 ms for 100 ms
-- Process 2 must wait for a core
-- Ready queue now contains 3 process(es) waiting for a core
-- CORE completion event for process 0 at time 110 ms
-- Process 1 will release a core at time 210 ms
-- Process 0 requests input from user at time 110 ms for 5000
ms
-- Process 0 starts input at time 110 ms
-- Process 0 will complete input at time 5110 ms
-- CORE completion event for process 3 at time 140 ms
33. -- Process 4 will release a core at time 180 ms
-- Process 3 requests SSD access at time 140 ms for 1 ms
-- Process 3 will release the SSD at time 141 ms
-- SSD completion event for process 3 at time 141 ms
-- Process 3 requests a core at time 141 ms for 100 ms
-- Process 3 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 4 at time 180 ms
-- Process 2 will release a core at time 280 ms
-- Process 4 requests SSD access at time 180 ms for 1 ms
-- Process 4 will release the SSD at time 181 ms
-- SSD completion event for process 4 at time 181 ms
-- Process 4 requests a core at time 181 ms for 100 ms
-- Process 4 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 1 at time 210 ms
-- Process 3 will release a core at time 310 ms
-- Process 1 requests SSD access at time 210 ms for 1 ms
34. -- Process 1 will release the SSD at time 211 ms
-- SSD completion event for process 1 at time 211 ms
-- Process 1 requests a core at time 211 ms for 200 ms
-- Process 1 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 2 at time 280 ms
-- Process 4 will release a core at time 380 ms
-- Process 2 requests SSD access at time 280 ms for 1 ms
-- Process 2 will release the SSD at time 281 ms
-- SSD completion event for process 2 at time 281 ms
-- Process 2 requests a core at time 281 ms for 200 ms
-- Process 2 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 3 at time 310 ms
-- Process 1 will release a core at time 510 ms
-- Process 3 requests SSD access at time 310 ms for 1 ms
-- Process 3 will release the SSD at time 311 ms
-- SSD completion event for process 3 at time 311 ms
35. -- Process 3 requests a core at time 311 ms for 200 ms
-- Process 3 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 4 at time 380 ms
-- Process 2 will release a core at time 580 ms
-- Process 4 requests SSD access at time 380 ms for 1 ms
-- Process 4 will release the SSD at time 381 ms
-- SSD completion event for process 4 at time 381 ms
-- Process 4 requests a core at time 381 ms for 200 ms
-- Process 4 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 1 at time 510 ms
-- Process 3 will release a core at time 710 ms
-- Process 1 requests SSD access at time 510 ms for 1 ms
-- Process 1 will release the SSD at time 511 ms
-- SSD completion event for process 1 at time 511 ms
-- Process 1 requests a core at time 511 ms for 50 ms
-- Process 1 must wait for a core
36. -- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 2 at time 580 ms
-- Process 4 will release a core at time 780 ms
-- Process 2 requests SSD access at time 580 ms for 1 ms
-- Process 2 will release the SSD at time 581 ms
-- SSD completion event for process 2 at time 581 ms
-- Process 2 requests a core at time 581 ms for 50 ms
-- Process 2 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 3 at time 710 ms
-- Process 1 will release a core at time 760 ms
-- Process 3 requests SSD access at time 710 ms for 1 ms
-- Process 3 will release the SSD at time 711 ms
-- SSD completion event for process 3 at time 711 ms
-- Process 3 requests a core at time 711 ms for 50 ms
-- Process 3 must wait for a core
-- Ready queue now contains 2 process(es) waiting for a core
-- CORE completion event for process 1 at time 760 ms
37. -- Process 2 will release a core at time 810 ms
-- Process 1 requests input from user at time 760 ms for 5000
ms
-- Process 1 must wait for user
-- Input queue now contains 1 process(es) waiting for the user
-- CORE completion event for process 4 at time 780 ms
-- Process 3 will release a core at time 830 ms
-- Process 4 requests SSD access at time 780 ms for 1 ms
-- Process 4 will release the SSD at time 781 ms
-- SSD completion event for process 4 at time 781 ms
-- Process 4 requests a core at time 781 ms for 50 ms
-- Process 4 must wait for a core
-- Ready queue now contains 1 process(es) waiting for a core
-- CORE completion event for process 2 at time 810 ms
-- Process 4 will release a core at time 860 ms
-- Process 2 requests input from user at time 810 ms for 5000
ms
-- Process 2 must wait for user
-- Input queue now contains 2 process(es) waiting for the user
38. -- CORE completion event for process 3 at time 830 ms
-- Process 3 requests input from user at time 830 ms for 5000
ms
-- Process 3 must wait for user
-- Input queue now contains 3 process(es) waiting for the user
-- CORE completion event for process 4 at time 860 ms
-- Process 4 requests input from user at time 860 ms for 1000
ms
-- Process 4 must wait for user
-- Input queue now contains 4 process(es) waiting for the user
-- INPUT completion event for process 0 at time 5110 ms
-- Process 1 will complete input at time 10110 ms
-- Process 0 requests a core at time 5110 ms for 100 ms
-- Process 0 will release a core at time 5210 ms
-- CORE completion event for process 0 at time 5210 ms
-- Process 0 requests SSD access at time 5210 ms for 1 ms
-- Process 0 will release the SSD at time 5211 ms
-- SSD completion event for process 0 at time 5211 ms
-- Process 0 requests a core at time 5211 ms for 80 ms
39. -- Process 0 will release a core at time 5291 ms
-- CORE completion event for process 0 at time 5291 ms
-- Process 0 requests SSD access at time 5291 ms for 1 ms
-- Process 0 will release the SSD at time 5292 ms
-- SSD completion event for process 0 at time 5292 ms
-- Process 0 requests a core at time 5292 ms for 100 ms
-- Process 0 will release a core at time 5392 ms
-- CORE completion event for process 0 at time 5392 ms
-- Process 0 requests SSD access at time 5392 ms for 1 ms
-- Process 0 will release the SSD at time 5393 ms
-- SSD completion event for process 0 at time 5393 ms
-- Process 0 requests a core at time 5393 ms for 80 ms
-- Process 0 will release a core at time 5473 ms
-- CORE completion event for process 0 at time 5473 ms
-- Process 0 requests SSD access at time 5473 ms for 0 ms
-- Process 0 will release the SSD at time 5473 ms
-- SSD completion event for process 0 at time 5473 ms
-- Process 0 requests a core at time 5473 ms for 30 ms
40. -- Process 0 will release a core at time 5503 ms
-- CORE completion event for process 0 at time 5503 ms
-- Process 0 requests SSD access at time 5503 ms for 1 ms
-- Process 0 will release the SSD at time 5504 ms
-- SSD completion event for process 0 at time 5504 ms
-- Process 0 requests a core at time 5504 ms for 20 ms
-- Process 0 will release a core at time 5524 ms
-- CORE completion event for process 0 at time 5524 ms
-- Process 0 requests SSD access at time 5524 ms for 1 ms
-- Process 0 will release the SSD at time 5525 ms
-- SSD completion event for process 0 at time 5525 ms
-- Process 0 requests a core at time 5525 ms for 80 ms
-- Process 0 will release a core at time 5605 ms
-- CORE completion event for process 0 at time 5605 ms
-- Process 0 requests SSD access at time 5605 ms for 0 ms
-- Process 0 will release the SSD at time 5605 ms
-- SSD completion event for process 0 at time 5605 ms
-- Process 0 requests a core at time 5605 ms for 40 ms
41. -- Process 0 will release a core at time 5645 ms
-- CORE completion event for process 0 at time 5645 ms
-- Process 0 requests SSD access at time 5645 ms for 1 ms
-- Process 0 will release the SSD at time 5646 ms
-- SSD completion event for process 0 at time 5646 ms
-- Process 0 requests a core at time 5646 ms for 20 ms
-- Process 0 will release a core at time 5666 ms
-- CORE completion event for process 0 at time 5666 ms
Process 0 terminates at time 5666 ms
Process 0 is TERMINATED
Process 1 is BLOCKED
Process 2 is BLOCKED
Process 3 is BLOCKED
Process 4 is BLOCKED
-- INPUT completion event for process 1 at time 10110 ms
-- Process 2 will complete input at time 15110 ms
42. -- Process 1 requests a core at time 10110 ms for 100 ms
-- Process 1 will release a core at time 10210 ms
-- CORE completion event for process 1 at time 10210 ms
-- Process 1 requests SSD access at time 10210 ms for 1 ms
-- Process 1 will release the SSD at time 10211 ms
-- SSD completion event for process 1 at time 10211 ms
-- Process 1 requests a core at time 10211 ms for 80 ms
-- Process 1 will release a core at time 10291 ms
-- CORE completion event for process 1 at time 10291 ms
-- Process 1 requests SSD access at time 10291 ms for 1 ms
-- Process 1 will release the SSD at time 10292 ms
-- SSD completion event for process 1 at time 10292 ms
-- Process 1 requests a core at time 10292 ms for 100 ms
-- Process 1 will release a core at time 10392 ms
-- CORE completion event for process 1 at time 10392 ms
-- Process 1 requests SSD access at time 10392 ms for 1 ms
-- Process 1 will release the SSD at time 10393 ms
-- SSD completion event for process 1 at time 10393 ms
43. -- Process 1 requests a core at time 10393 ms for 80 ms
-- Process 1 will release a core at time 10473 ms
-- CORE completion event for process 1 at time 10473 ms
-- Process 1 requests SSD access at time 10473 ms for 1 ms
-- Process 1 will release the SSD at time 10474 ms
-- SSD completion event for process 1 at time 10474 ms
-- Process 1 requests a core at time 10474 ms for 100 ms
-- Process 1 will release a core at time 10574 ms
-- CORE completion event for process 1 at time 10574 ms
-- Process 1 requests SSD access at time 10574 ms for 1 ms
-- Process 1 will release the SSD at time 10575 ms
-- SSD completion event for process 1 at time 10575 ms
-- Process 1 requests a core at time 10575 ms for 40 ms
-- Process 1 will release a core at time 10615 ms
-- CORE completion event for process 1 at time 10615 ms
Process 1 terminates at time 10615 ms
Process 1 is TERMINATED
44. Process 2 is BLOCKED
Process 3 is BLOCKED
Process 4 is BLOCKED
-- INPUT completion event for process 2 at time 15110 ms
-- Process 3 will complete input at time 20110 ms
-- Process 2 requests a core at time 15110 ms for 100 ms
-- Process 2 will release a core at time 15210 ms
-- CORE completion event for process 2 at time 15210 ms
-- Process 2 requests SSD access at time 15210 ms for 1 ms
-- Process 2 will release the SSD at time 15211 ms
-- SSD completion event for process 2 at time 15211 ms
-- Process 2 requests a core at time 15211 ms for 80 ms
-- Process 2 will release a core at time 15291 ms
-- CORE completion event for process 2 at time 15291 ms
-- Process 2 requests SSD access at time 15291 ms for 1 ms
-- Process 2 will release the SSD at time 15292 ms
-- SSD completion event for process 2 at time 15292 ms
45. -- Process 2 requests a core at time 15292 ms for 100 ms
-- Process 2 will release a core at time 15392 ms
-- CORE completion event for process 2 at time 15392 ms
-- Process 2 requests SSD access at time 15392 ms for 1 ms
-- Process 2 will release the SSD at time 15393 ms
-- SSD completion event for process 2 at time 15393 ms
-- Process 2 requests a core at time 15393 ms for 80 ms
-- Process 2 will release a core at time 15473 ms
-- CORE completion event for process 2 at time 15473 ms
-- Process 2 requests SSD access at time 15473 ms for 1 ms
-- Process 2 will release the SSD at time 15474 ms
-- SSD completion event for process 2 at time 15474 ms
-- Process 2 requests a core at time 15474 ms for 100 ms
-- Process 2 will release a core at time 15574 ms
-- CORE completion event for process 2 at time 15574 ms
-- Process 2 requests SSD access at time 15574 ms for 1 ms
-- Process 2 will release the SSD at time 15575 ms
-- SSD completion event for process 2 at time 15575 ms
46. -- Process 2 requests a core at time 15575 ms for 40 ms
-- Process 2 will release a core at time 15615 ms
-- CORE completion event for process 2 at time 15615 ms
Process 2 terminates at time 15615 ms
Process 2 is TERMINATED
Process 3 is BLOCKED
Process 4 is BLOCKED
-- INPUT completion event for process 3 at time 20110 ms
-- Process 4 will complete input at time 21110 ms
-- Process 3 requests a core at time 20110 ms for 100 ms
-- Process 3 will release a core at time 20210 ms
-- CORE completion event for process 3 at time 20210 ms
-- Process 3 requests SSD access at time 20210 ms for 1 ms
-- Process 3 will release the SSD at time 20211 ms
-- SSD completion event for process 3 at time 20211 ms
-- Process 3 requests a core at time 20211 ms for 80 ms
47. -- Process 3 will release a core at time 20291 ms
-- CORE completion event for process 3 at time 20291 ms
-- Process 3 requests SSD access at time 20291 ms for 1 ms
-- Process 3 will release the SSD at time 20292 ms
-- SSD completion event for process 3 at time 20292 ms
-- Process 3 requests a core at time 20292 ms for 100 ms
-- Process 3 will release a core at time 20392 ms
-- CORE completion event for process 3 at time 20392 ms
-- Process 3 requests SSD access at time 20392 ms for 1 ms
-- Process 3 will release the SSD at time 20393 ms
-- SSD completion event for process 3 at time 20393 ms
-- Process 3 requests a core at time 20393 ms for 80 ms
-- Process 3 will release a core at time 20473 ms
-- CORE completion event for process 3 at time 20473 ms
-- Process 3 requests SSD access at time 20473 ms for 1 ms
-- Process 3 will release the SSD at time 20474 ms
-- SSD completion event for process 3 at time 20474 ms
-- Process 3 requests a core at time 20474 ms for 100 ms
48. -- Process 3 will release a core at time 20574 ms
-- CORE completion event for process 3 at time 20574 ms
-- Process 3 requests SSD access at time 20574 ms for 1 ms
-- Process 3 will release the SSD at time 20575 ms
-- SSD completion event for process 3 at time 20575 ms
-- Process 3 requests a core at time 20575 ms for 40 ms
-- Process 3 will release a core at time 20615 ms
-- CORE completion event for process 3 at time 20615 ms
Process 3 terminates at time 20615 ms
Process 3 is TERMINATED
Process 4 is BLOCKED
-- INPUT completion event for process 4 at time 21110 ms
-- Process 4 requests a core at time 21110 ms for 100 ms
-- Process 4 will release a core at time 21210 ms
-- CORE completion event for process 4 at time 21210 ms
-- Process 4 requests SSD access at time 21210 ms for 1 ms
49. -- Process 4 will release the SSD at time 21211 ms
-- SSD completion event for process 4 at time 21211 ms
-- Process 4 requests a core at time 21211 ms for 80 ms
-- Process 4 will release a core at time 21291 ms
-- CORE completion event for process 4 at time 21291 ms
-- Process 4 requests SSD access at time 21291 ms for 1 ms
-- Process 4 will release the SSD at time 21292 ms
-- SSD completion event for process 4 at time 21292 ms
-- Process 4 requests a core at time 21292 ms for 100 ms
-- Process 4 will release a core at time 21392 ms
-- CORE completion event for process 4 at time 21392 ms
-- Process 4 requests SSD access at time 21392 ms for 1 ms
-- Process 4 will release the SSD at time 21393 ms
-- SSD completion event for process 4 at time 21393 ms
-- Process 4 requests a core at time 21393 ms for 80 ms
-- Process 4 will release a core at time 21473 ms
-- CORE completion event for process 4 at time 21473 ms
-- Process 4 requests SSD access at time 21473 ms for 1 ms
50. -- Process 4 will release the SSD at time 21474 ms
-- SSD completion event for process 4 at time 21474 ms
-- Process 4 requests a core at time 21474 ms for 100 ms
-- Process 4 will release a core at time 21574 ms
-- CORE completion event for process 4 at time 21574 ms
-- Process 4 requests SSD access at time 21574 ms for 1 ms
-- Process 4 will release the SSD at time 21575 ms
-- SSD completion event for process 4 at time 21575 ms
-- Process 4 requests a core at time 21575 ms for 40 ms
-- Process 4 will release a core at time 21615 ms
-- CORE completion event for process 4 at time 21615 ms
Process 4 terminates at time 21615 ms
Process 4 is TERMINATED
SUMMARY:
Number of processes that completed: 5
Total number of SSD accesses: 40
57. CORE 20
END
The first spring 2020
assignment
explained
Jehan-François Pâris
[email protected]
A very simple case
START 120 // new process at T=1200
PID 23 // process ID
CORE 100 // request CORE for 100 ms
TTY 5000 // 5000 ms user interaction
CORE 80 // request CORE for 80 ms
SSD 1 // request SSD for 1 ms
CORE 30 // request CORE for 30 ms
SSD 1 // request SSD for 1 ms
CORE 20 // request CORE for 20 ms
The model
We have
• One single-core CPU
58. • NCORES = 1
• One SSD
• Many user windows
• Two CPU queues
– Interactive
– Non-interactive
Core
I
Q
NI
Q
SSD TTY
SSD
Q
Process states
A process can be
• Running
• It occupies a core
• Ready
• It waits for a core
• Blocked
59. • It wait for an I/O
completion
Core
I
Q
NI
Q
SSD TTY
SSD
Q
The solution (I)
k at T=120 ms
The solution (II)
61. completion at T=5,331+1=5,332ms
The solution (V)
Another way to look at it
NCORES 1
START 120
PID 23
CORE 100
TTY 5000
CORE 80
SSD 1
CORE 30
SSD 1
CORE 20
Core
62. I
Q
NI
Q
SSD TTY
SSD
Q
T=120ms Process 23 arrives
Gets core until T = 120+100 = 220ms
NCORES 1
START 120
PID 23
CORE 100
TTY 5000
CORE 80
SSD 1
CORE 30
SSD 1
CORE 20
Core
I
Q
NI
Q
SSD TTY
63. SSD
Q
T=220ms Process 23 releases core
gets TTY until = 220+5,000 = 5,220ms
NCORES 1
START 120
PID 23
CORE 100
TTY 5000
CORE 80
SSD 1
CORE 30
SSD 1
CORE 20
Core
I
Q
NI
Q
SSD TTY
SSD
Q
T=5,220ms Process 23 gets core until
70. Process 1
The solution (I)
Time Command Action(s)
0 NEW 0 Process 0 starts
0 CORE 10 P0 gets core until T=10ms
5 NEW 5 Process 1 starts
5 CORE 20 Core is busy:
P1 enters NI queue
P1 is in READY state
10 SSD 1 P0 releases the CPU
Gets SSD until T=11 ms
P1 gets CPU until T=30ms
P1 is in RUNNING state
The solution (II)
Time Command Action(s)
11 CORE 30 CPU is busy:
P0 enters NI queue
P0 is in READY state
30 SSD 0 P1 releases the CPU
Gets SSD until T=30 ms
P0 gets CPU until T=60ms
30 CORE 40 CPU is busy:
P1 enters NI queue
71. P1 is in READY state
The solution (III)
Time Command Action(s)
60 P0 releases CPU and
terminates
P1 gets CPU until T=100ms
100 P1 releases CPU and
terminates
Another way to look at it
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
73. must always pick the one associated with the
next event
T = 0ms
Start
Process 0
Non-interactive
T = 5ms
Start
Process 1
Non-interactive
T= 0ms P0 gets core until T = 10ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
74. NI
Q
SSD TTY
SSD
Q
We update the event list
T = 10ms
Core
Process 0
Non-interactive
T = 5ms
Start
Process 1
Non-interactive
Finding the next step
T = 10ms
Core
Process 0
Non-interactive
T = 5ms
75. Start
Process 1
Non-interactive
T=5ms P1 waits for P0 to release core at T=10ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
NI
Q
SSD TTY
SSD
Q
76. We update the event list
Time 10
Core
Process 0
Non-Interactive
Finding the next step
T = 10ms
Core
Process 0
Non-Interactive
T=10ms P0 gets SSD until T=11ms
P1 gets core until T=30ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
77. I
Q
NI
Q
SSD TTY
SSD
Q
We update the event list
T = 11ms
SSD
Process 0
Non-Interactive
T = 30ms
Core
Process 1
Non-Interactive
Finding the next step
T = 11ms
SSD
Process 0
78. Non-interactive
T = 30ms
Core
Process 1
Non-Interactive
T=11ms P0 waits for P1 to release core at T=30ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
NI
Q
SSD TTY
SSD
Q
79. We update the event list
T = 30ms
Core
Process 1
Non-Interactive
Finding the next step
T = 30ms
Core
Process 1
Non-Interactive
T=30ms P1 gets SSD until T=30+0=30ms
P0 gets core until T=30+30=60ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
80. CORE 40
Core
I
Q
NI
Q
SSD TTY
SSD
Q
We update the event list
T = 30ms
SSD
Process 1
Non-Interactive
T = 60ms
Core
Process 2
Non-Interactive
Finding the next step
T = 30ms
81. SSD
Process 1
Non-Interactive
T = 60ms
Core
Process 0
Non-Interactive
T=30ms P1 waits for P0 to release core at T=60ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
NI
Q
SSD TTY
82. SSD
Q
We update the event list
T = 60ms
Core
Process 0
Non-Interactive
Finding the next step
T = 60ms
Core
Process 0
Non-Interactive
T=60ms P0 to release core and terminates
P1 gets core until T=100ms
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
83. PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
NI
Q
SSD TTY
SSD
Q
We update the event list
T = 100ms
Core
Process 1
Non-Interactive
Finding the next step
T = 100ms
Core
Process 1
84. Non-Interactive
T=100ms P1 releases core and terminates
NCORES 1
START 0
PID 0
CORE 10
SSD 1
CORE 30
START 5
PID 1
CORE 20
SSD 0
CORE 40
Core
I
Q
NI
Q
SSD TTY
SSD
Q
We update the event list
85. Scheduling the CPU
completed a user interaction
Higher priority
-interactive queue
Example (I)
releases a core,
process 4 will get
it ahead of 2 and
3.
Core
I
Q
88. Simulating time
between two successive "events"
n of a user interaction
Organizing our program (I)
future completion events
notice
ce
89. -interactive bit
Organizing our program (II)
-interactive bit
-interactive
Organizing our program (III)
T = 247
SSD
0
NI
T = 250
Core
1
NI
90. T = 245
Start
2
NI
T = 270
Start
3
NI
T = 310
Start
4
NI
First notice to
be processed
Organizing our program (IV)
tion of main program
read in input file
schedule all process starts
while (event list is not empty) {
process next event in list
} // while
print simulation results
91. Organizing our program (IV)
pop event from list
clock = event.time
if (event.type is arrival) {
arrival(event.time, event.seqno)
} else if (event.type is core) {
…
Organizing our event list (I)
With each user interaction
Organizing our event list
92. First notice to be processed
is at the head of the list
T = 247
SSD
0
NI
T = 250
Core
1
NI
T = 245
Start
2
NI
T = 270
Start
3
NI
T = 310
Start
4
NI
Arrival event routine
93. arrival(time, seqno) {
mark process non-interactive
process first request of new process
} // arrival
Core request routine
core_request(how_long, seqno, isinteract){
if (nfreecores > 0) {
nfreecores--;
schedule completion at time
current_time + how_long
for process seqno;
} else {
if (isinteract == interactive) {
queue proc_id in i_queue
} else {
queue proc_id in ni_queue
} // inner if
} // outer if
} // core_request
Core completion routine
core_release (seqno){
if (i_queue is not empty) {
94. pop first request in i_queue
schedule its completion at
current_time + how_long;
} else if (ni_queue is not empty {
pop first request in ni_queue
schedule its completion at
current_time + how_long;
} else {
nfreecores++;
} //if
process next process request;
} // core_release
SSD request routine
ssd_request(how_long, seqno){
if (ssd == FREE) {
ssd = BUSY;
schedule completion at time
current_time + how_long
for process seqno;
} else {
queue process seqno in
ssd queue;
} // if
} // ssd_request
95. SSD completion routine
ssd_release (seqno, &isinteract){
isinteract = non_interactive;
if (ssd queue is not empty) {
pop first request in ssd queue
schedule its completion at
current_time + how_long;
} else {
ssd = FREE;
} // if
process next process request;
} // ssd_release
User request routine
user_request (how_long, seqno){
schedule completion at time
current_time + how_long
for process process_id;
} // user_request
User completion routine
99. function calls
specific events
Finding the next event
u do not use a priority list for your events,
you can find the next event to process by
searching the lowest value in
table
AN IMPLEMENTATION
100. The input table
data
used in process
table
Operation Parameter
START 5
PID 10
CORE 20
SSD 0
CORE 20
START 50
PID 20
… …
Most elegant input table
START
5
START
50
101. PID
10
PID
20
… …
Top array indexed
by process
sequence numbers
…
The process table (I)
PID Start
Time
First
Line
Last
Line
Current
Line
State
10 5 0 4 varies varies
20 50 5 … …
102. … … … …
The process table (II)
identify first line, last line and current line of the
process in the input table
process (READY, RUNNING or BLOCKED)
The device table (I)
Device Status Busy times total
CPU P0 15
SSD - --
The device table (II)
ne per device
104. data
Last updated on Monday, January 13, 2020.
COSC 3360‐ Operating System Fundamentals
Assignment #1: Process Scheduling
Due Wednesday, February 12, 2019 at 11:59:59
1. OBJECTIVE
This assignment will introduce you to core scheduling.
2. SPECIFICATIONS
You are to simulate the execution of processes by a tablet
with a large memory, one display, a multi-core processing
unit, and one solid-state drive. Each process will be
described by its start time and its process id followed by a
sequence of resource requests.
These resources requests will include core requests
(CORE), SSD requests (SSD) and user interactions (TTY).
Your input will be a sequence of pairs as in:
NCORES 2 // number of cores
START 12000 // new process
PID 23 // process ID
105. CORE 100 // request CORE for 100 ms
TTY 5000 // 5000 ms user interaction
CORE 80 // request CORE for 80 ms
SSD 1 // request SSD for 1 ms
CORE 30 // request CORE for 30 ms
SSD 1 // request SSD for 1 ms
CORE 20 // request CORE for 20 ms
START 12040 // new process
...
END // end of data
All times will be expressed in milliseconds. All
process start times will be monotonically increasing. The
last line of input will contain an END.
Processor Management: Your program should have two
ready queues, namely:
1. A interactive queue that contains all processes
have just completed a user interaction,
2. A non-interactive queue that contains all other
processes waiting for a core.
Each time your program answers process core
requests, it should give priority to processes in the
interactive queue and only allocate cores to processes from
the non-interactive queue when the interactive queue is
empty.
Both ready queues should be FIFO queues and keep
all processes ordered according to their queue arrival time
in strict first-come first-served order.
SSD Management: SSD access times are much shorter
than disk access times with write requests taking less than
106. a millisecond and read requests taking much less than that.
As a result, write request timings will be rounded up to one
millisecond and read requests timing will be rounded down to
zero. SSD scheduling will be strictly first-come first-served.
To simplify your life, we will also assume that:
1. There is no contention for main memory,
2. Context switch times can be neglected, and
3. User think times and other delays, like overlapping
windows, are included in the TTY times.
In addition, you can assume that all inputs will always be
correct.
Program organization: Your program should read its input file
name though input redirection as in:
./a.out < input.txt
Your program should have one process table with one entry
per process containing its process id, the process class, its
process arrival time and its current state (RUNNING, READY
or
BLOCKED).
Since you are to focus on the scheduling actions taken by
the system you are simulating, your program will only have to
intervene whenever
1. A process is loaded into memory,
2. A process completes a computational step.
107. All times should be simulated.
Each time a process starts or terminates your program
should print a snap shot containing:
1. The current simulated time in milliseconds,
2. The process id (PID) of the process causing the
snapshot, and the states of all other active processes
When all the processes in your input stream have completed,
your simulator should print a summary report listing:
1. The total simulation time n millisecond,
2. The number of processes that have completed,
3. The total number of SSD accesses,
4. The average number of busy cores (between zero and
NCORES),
5. The SSD utilization, that is, the fraction of time that
device was busy (between zero and one).
3. IMPORTANT
Your program should start by a block of comments containing
your name, the course number, the due date and a very short
description of the assignment. Each class, method or function
should start by a very brief description of the task it performs.