67 Pages

Lecture4

Course: CS 4323, Spring 2012
School: Oklahoma State
Rating:
 
 
 
 
 

Word Count: 3131

Document Preview

4: Chapter Threads Operating System Concepts 8th Edition, Silberschatz, Galvin and Gagne 2009 Chapter 4: Threads s Overview s Multithreading Models s Thread Libraries s Threading Issues s Operating System Examples q Windows XP Threads q Solaris q Linux Threads Operating System Concepts 8th Edition 4.2 Silberschatz, Galvin and Gagne 2009 Objectives s To introduce the notion of a thread a fundamental...

Register Now

Unformatted Document Excerpt

Coursehero >> Oklahoma >> Oklahoma State >> CS 4323

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
4: Chapter Threads Operating System Concepts 8th Edition, Silberschatz, Galvin and Gagne 2009 Chapter 4: Threads s Overview s Multithreading Models s Thread Libraries s Threading Issues s Operating System Examples q Windows XP Threads q Solaris q Linux Threads Operating System Concepts 8th Edition 4.2 Silberschatz, Galvin and Gagne 2009 Objectives s To introduce the notion of a thread a fundamental unit of CPU utilization that forms the basis of multithreaded computer systems s To discuss the APIs for the Pthreads, Win32, and Java thread libraries s To examine issues related to multithreaded programming Operating System Concepts 8th Edition 4.3 Silberschatz, Galvin and Gagne 2009 Processes and Threads s Processes have two characteristics: q Resource ownership - process includes a virtual address space to hold the process image q Scheduling/execution - follows an execution path that may be interleaved with other processes s These two characteristics are treated independently by an operating system Operating System Concepts 8th Edition 4.4 Silberschatz, Galvin and Gagne 2009 Process s The resource ownership is referred to as the process or task process s Has program, data, PCB, shared variables, process image, etc Operating System Concepts 8th Edition 4.5 Silberschatz, Galvin and Gagne 2009 Threads s Scheduling is referred to as a thread or lightweight process Operating System Concepts 8th Edition 4.6 Silberschatz, Galvin and Gagne 2009 Threads in Process s Each thread has q An execution state (running, ready, etc.) q Saved q An thread context when not running execution stack q Some per-thread static storage for local variables q Access to the memory and resources of its process (all threads of a process share this) s One way to view a thread is as an independent program counter operating within a process. Operating System Concepts 8th Edition 4.7 Silberschatz, Galvin and Gagne 2009 Traditional approach s Single thread of execution per process s Concept of thread not recognized independently s This is the single-threaded approach Operating System Concepts 8th Edition 4.8 Silberschatz, Galvin and Gagne 2009 Multithreading s The ability of an OS to support multiple, concurrent paths of execution within a single process. Operating System Concepts 8th Edition 4.9 Silberschatz, Galvin and Gagne 2009 Benefits of Threads s Takes less time to create a new thread than a process s Less time to terminate a thread than a process s Switching between two threads takes less time that switching processes s Threads can communicate with each other q without invoking the kernel q No need for shared memory or message passing Operating System Concepts 8th Edition 4.10 Silberschatz, Galvin and Gagne 2009 Example: Remote Procedure Call s Consider: qA program that performs two remote procedure calls (RPCs) q to two different hosts q to obtain a combined result Operating System Concepts 8th Edition 4.11 Silberschatz, Galvin and Gagne 2009 RPC Using Single Thread Operating System Concepts 8th Edition 4.12 Silberschatz, Galvin and Gagne 2009 RPC Using One Thread per Server Operating System Concepts 8th Edition 4.13 Silberschatz, Galvin and Gagne 2009 Example: web server s Web server accepts concurrent client requests s Either serve one client at a time or create several processes s Rather have one thread to listen client requests and create one independent thread to serve each request Operating System Concepts 8th Edition 4.14 Silberschatz, Galvin and Gagne 2009 Multicore systems s Multiple computing cores on a single cheap s In a single core, multithreading only implement concurrency where thread interleave over time but only one thread is executed at a time s Multithreading helps to efficiently used multiple core architectures, threads may run in parallel Operating System Concepts 8th Edition 4.15 Silberschatz, Galvin and Gagne 2009 Thread Libraries s Threads are implemented with thread libraries which provide programmer with API for creating and managing threads s Two primary ways of implementing q Library entirely in user space: Invoking a function in the library results in a local function call, not a system call q Kernel-level library supported by the OS: Code and data structures in kernel space, invoking a function results in a system call Operating System Concepts 8th Edition 4.16 Silberschatz, Galvin and Gagne 2009 Types of Threads s Threads which are supported entirely by libraries in the user space are called user threads s Threads which are supported entirely by libraries in the kernel are called kernel threads s Whether it is in user mode or kernel mode, thread libraries must exist to support the management of threads s There is a complex relationship between user application, user threads and kernel threads Operating System Concepts 8th Edition 4.17 Silberschatz, Galvin and Gagne 2009 User-Level Threads (UTL) s All thread management is done by userlevel threads library s The kernel is not aware of the existence of threads s POSIX Pthreads Operating System Concepts 8th Edition 4.18 Silberschatz, Galvin and Gagne 2009 User Level Threads s Advantages q Thread switching does not require kernel privileges, all thread management done in the user address space q Scheduling can be application specific q ULTs can run on any OS s Disadvantages: q When a ULT execute a system call, all threads of the corresponding process are blocked q Cannot take advantage of multiprocessing, one process to one processor at a time Operating System Concepts 8th Edition 4.19 Silberschatz, Galvin and Gagne 2009 Kernel-Level Threads (KLT) s Kernel maintains context information for the process and the threads q No thread management done by application s Scheduling is done on a thread basis s Windows, Solaris, Linux, Mac OS X are examples of this approach Operating System Concepts 8th Edition 4.20 Silberschatz, Galvin and Gagne 2009 Advantages/Disadvantages of KLT s Advantages: q The kernel can simultaneously schedule multiple threads from the same process on multiple processors. q If one thread in a process is blocked, the kernel can schedule another thread of the same process. s Disadvantages: q The transfer of control from one thread to another within the same process requires a mode switch to the kernel Operating System Concepts 8th Edition 4.21 Silberschatz, Galvin and Gagne 2009 Combined Approaches s Thread creation done in the user space s Bulk of scheduling and synchronization of threads by the application s Example is Solaris Operating System Concepts 8th Edition 4.22 Silberschatz, Galvin and Gagne 2009 Combined Multithreading Models s Relationships existing between user level threads and kernel level threads: q Many-to-One q One-to-One q Many-to-Many Operating System Concepts 8th Edition 4.23 Silberschatz, Galvin and Gagne 2009 Many-to-One s Many user-level threads mapped to single kernel thread s Examples: q Solaris Green Threads q GNU Portable Threads Operating System Concepts 8th Edition 4.24 Silberschatz, Galvin and Gagne 2009 Relationships between Thread and Process(1) s Process B is running s Thread one is ready s Thread 2 is running Operating System Concepts 8th Edition 4.25 Silberschatz, Galvin and Gagne 2009 Relationships between Thread and Process(3) s OS place B in Ready and switches to another process s According to data structure of the user level threads library, thread 2 still running Operating System Concepts 8th Edition 4.26 Silberschatz, Galvin and Gagne 2009 Relationships between Thread and Process(2) s Thread 2 made a system call s Which blocks process B s Thread 2 still seen as running by the user level threads library Operating System Concepts 8th Edition 4.27 Silberschatz, Galvin and Gagne 2009 Relationships between Thread and Process(4) s Thread 2 needs actions performed by thread 1 s Thread 2 enters a blocked state s Thread 1 transits from Ready to Running s Process B remains Running Operating System Concepts 8th Edition 4.28 Silberschatz, Galvin and Gagne 2009 One-to-One s Each user-level thread maps to kernel thread s Examples: Windows NT/XP/2000; Linux; Solaris 9 and later Operating System Concepts 8th Edition 4.29 Silberschatz, Galvin and Gagne 2009 Many-to-Many s Allows many user level threads to be mapped to many kernel threads s Allows the operating system to create a sufficient number of kernel threads s Solaris before 9 Operating System Concepts 8th Edition 4.30 Silberschatz, Galvin and Gagne 2009 Implementation: Combined Approach LWP is a data structure appearing as a virtual processor to the ULT Each LWP attached to a kernel thread Application schedules threads to run on the LWP If kernel thread blocked than user threads blocked also Operating System Concepts 8th Edition 4.31 Silberschatz, Galvin and Gagne 2009 Thread basics s Thread operations include q thread creation, termination, synchronization (joins,blocking), scheduling, data management and process interaction. s A thread does not maintain a list of created threads, nor does it know the thread that created it. s All threads within a process share the same address space. Operating System Concepts 8th Edition 4.32 Silberschatz, Galvin and Gagne 2009 Thread basics s Threads in the same process share: q process instructions q most data q open files (descriptors) q signals and signal handlers q current working directory q User and group id Operating System Concepts 8th Edition 4.33 Silberschatz, Galvin and Gagne 2009 Thread basics s Each thread has a unique: q thread q set ID of registers, stack pointer q stack for local variables, return addresses q signal mask q priority q return Operating System Concepts 8th Edition value: errno 4.34 Silberschatz, Galvin and Gagne 2009 Thread Libraries s Three primary thread libraries: q POSIX Pthreads: API threads extension of POSIX standard. Provided at either user or kernel level. q Win32 threads: Kernel q level threads under Windows. Java threads: Created Operating System Concepts 8th Edition and managed in Java programs. 4.35 Silberschatz, Galvin and Gagne 2009 Pthreads s A POSIX standard (IEEE 1003.1c) API for thread creation and synchronization s API specifies behavior of the thread library, implementation is up to development of the library s Common in UNIX operating systems (Solaris, Linux, Mac OS X) s https://computing.llnl.gov/tutorials/pthreads/ Operating System Concepts Edition 4.36 Silberschatz, 8th Galvin and Gagne 2009 Pthreads example 1. #include<pthread.h> 2. #include<stdio.h> 3. int sum; /*This data is shared by the thread(s) */ 4. void *runner(void *param); /* the thread */ 5. main(int argc, char *argv[]) { 6. pthread_t tid; pthread_attr_t attr; /* thread attributes */ 7. if(argc != 2) { 8. fprintf(stderr,"usage: a.out <integer value>\n"); 9. exit(); } 10.if(atoi(argv[1]) < 0) { fprintf(stderr, "%d must be >= 0 \n", atoi(argv[1])); exit(); } Operating System Concepts 8th Edition 4.37 Silberschatz, Galvin and Gagne 2009 Thread creation and join 1. pthread_attr_init(&attr); /* get the default attributes */ 2. /*create the thread */ 3. pthread_create(&tid,&attr,runner,argv[1]); 4. /* Now wait for the thread to exit */ 5. pthread_join(tid,NULL); 6. printf("sum = %d\n",sum); Operating System Concepts 8th Edition 4.38 Silberschatz, Galvin and Gagne 2009 Thread execution s /*Thread begin execution in this function */ s void *runner(void *param) { q int upper = atoi(param); int i; sum=0; q if(upper > 0) { for(i=1; i <= upper;i++) sum += i; q } q pthread_exit(0); s} Operating System Concepts 8th Edition 4.39 Silberschatz, Galvin and Gagne 2009 Two other examples s See pdf files PthreadEx1 and PthreadEx2 Operating System Concepts 8th Edition 4.40 Silberschatz, Galvin and Gagne 2009 Java Threads s Java threads are managed by the JVM, they are user level threads s Java threads may be created by: q Extending Thread class q Implementing the Runnable interface s Typically implemented using the threads model provided by underlying OS q In Windows XP, one-to-one model (each Java thread maps to a kernel thread q Similarly with Solaris 9 and + Operating System Concepts 8th Edition 4.41 Silberschatz, Galvin and Gagne 2009 Java Threads s When a thread is created, it must be permanently bound to an object with a run() method. s When the thread is started, it will invoke the object's run() method. s Create the thread and supply it an object with a run() method s The object's run() method invoked when thread starts. Useful if want many threads sharing an object. Operating System Concepts 8th Edition 4.42 Silberschatz, Galvin and Gagne 2009 Java Threads - Example Program Operating System Concepts 8th Edition 4.43 Silberschatz, Galvin and Gagne 2009 Java Threads - Example Program Operating System Concepts 8th Edition 4.44 Silberschatz, Galvin and Gagne 2009 Threading Issues s Semantics of fork() and exec() system calls s Thread execution s Thread cancellation of target thread q Asynchronous or deferred s Signal handling Operating System Concepts 8th Edition 4.45 Silberschatz, Galvin and Gagne 2009 Semantics of fork() and exec() s Does fork() duplicate only the calling thread or all threads? q Some Unix have two versions of fork(): One duplicate all threads: forkall() One duplicate only the thread invoking fork1() s The execution of exec() destroy completely the calling program, including all the threads belonging to the corresponding process q Should not use the fork that duplicate all threads if exec() is called Operating System Concepts 8th Edition 4.46 Silberschatz, Galvin and Gagne 2009 Relations Threads/Processes s Actions that affect all of the threads in a process: q The OS must manage these at the process level s Examples: q Suspending a process involves suspending all threads of the process q Termination of a process, terminates all threads within the process Operating System Concepts 8th Edition 4.47 Silberschatz, Galvin and Gagne 2009 Thread Execution States s Key thread states are Running, Ready and Waiting s No suspend states as it is a per-process concept q If a process is swapped out, so all the threads since they shared the same address space with the swapped process Operating System Concepts 8th Edition 4.48 Silberschatz, Galvin and Gagne 2009 Thread Execution States (cont) s A thread is blocked when waiting for an event (saving its registers, program counter and stack pointers) s The occurrence of the event on which the thread was blocked triggers the thread to be placed in the ready queue s A thread within the process may spawn other threads s May synchronize with other threads q Similar Operating System Concepts 8th Edition to processes 4.49 Silberschatz, Galvin and Gagne 2009 Thread Cancellation s Terminating a thread before it has finished s Two general approaches: q Asynchronous cancellation terminates the target thread immediately q Deferred cancellation allows the target thread to periodically check if it should be cancelled Operating System Concepts 8th Edition 4.50 Silberschatz, Galvin and Gagne 2009 Signals s Signals are used in UNIX systems to notify a process that a particular event has occurred s Signals is an inter-process communication (Windows does not have signals) s A signal is not an exception although some exceptions may trigger a signal q For example, if a process attempted to divide by zero, a divide error exception would be generated and the kernel exception handler will to send the SIGFPE signal to the process Operating System Concepts 8th Edition 4.51 Silberschatz, Galvin and Gagne 2009 Examples of signals s Examples of signals q SIGHUP 1 Hangup ; q SIGINT 2 Interrupt ; q SIGKILL 9 Killed (by a control C key stroke); q SIGBUS 10 Bus Error ; q SIGSEGV 11 Segmentation Fault; q SIGSYS 12 Bad Argument to System Call ; q SIGCHLD 18 Child Status; s http://pubs.opengroup.org/onlinepubs/009695399/basedefs/signal.h.html Operating System Concepts 8th Edition 4.52 Silberschatz, Galvin and Gagne 2009 Signal Handling s When a process is de-scheduled, it looks for pending signals or it may be interrupted by OS on signal reception s A signal handler (default or user defined) is used to process signals 1. Signal is generated by particular event 2. Signal is delivered to a process 3. Signal is handled Every signal has default handler provided by the kernel However, users can install signal handlers with the signal() system call Processes may choose to ignore some signals except SIGKILL and SIGSTOP Operating System Concepts 8th Edition 4.53 Silberschatz, Galvin and Gagne 2009 Signal Handling and Threads s Delivering signals to multithreaded processes is complicated s Options: q Deliver the signal to the thread to which the signal applies q Deliver the signal to every thread in the process q Deliver the signal to certain threads in the process q Assign a specific threat to receive all signals for the process s If a thread generates a signal then it is delivered to the thread causing the signal s Threads may block some signals, signals deliver to the other threads which do not block it Operating System Concepts 8th Edition 4.54 Silberschatz, Galvin and Gagne 2009 Operating System Examples s Windows XP Threads s Solaris Threads s Linux Threads Operating System Concepts 8th Edition 4.55 Silberschatz, Galvin and Gagne 2009 Window XP Thread Structure Operating System Concepts 8th Edition 4.56 Silberschatz, Galvin and Gagne 2009 Windows Threads s One-to-one model (each user-level thread associated with a kernel thread) s Thread has a user stack and a kernel stack s Data structures: q ETHREAD Pointer to owner process; address of the routine where thread start q KTHREAD Scheduling and synchronization information, kernel stack q TEB User-mode Operating System Concepts 8th Edition thread 4.57 Silberschatz, Galvin and Gagne 2009 Windows TEB Windows thread information (environment) block s http://en.wikipedia.org/wiki/Win32_Thread_Information_Block Operating System Concepts 8th Edition 4.58 Silberschatz, Galvin and Gagne 2009 Windows Thread States Operating System Concepts 8th Edition 4.59 Silberschatz, Galvin and Gagne 2009 Windows Threads Multiprocessing s A Windows process must contain at least one thread. That thread may then creates other threads s Threads from different processes may run in parallel s In a multiprocessor system, thread on a same process may execute in parallel s Threads from a same process shared information through the common address space they share s Threads from different processes shared information through the shared memory segments Operating System Concepts 8th Edition 4.60 Silberschatz, Galvin and Gagne 2009 Solaris Process s Solaris makes use of four separate thread- related concepts: q Process: includes the users address space, stack, and process control block. q User-level threads: a user-created unit of execution within a process. q Lightweight processes: a mapping between ULTs and kernel threads. q Kernel Operating System Concepts 8th Edition threads 4.61 Silberschatz, Galvin and Gagne 2009 Relationship between Processes and Threads Operating System Concepts 8th Edition 4.62 Silberschatz, Galvin and Gagne 2009 ULTs/LWP/KLTs s One kernel thread for each LWP s A process may consist of a single ULT bound to a single LWP. There is a single thread which corresponds to traditional Unix process s A process may consist of several ULTs each bound to a single LWP, each LWP is bound to a single kernel thread Operating System Concepts 8th Edition 4.63 Silberschatz, Galvin and Gagne 2009 Linux Process/Thread Model s Linux does not recognize a distinction between processes and threads s Use a mechanism similar to LWP of Solaris where ULTs are mapped into kernel-level processes that share the same group ID s Processes in a group share resources such as files and memory, no need for context switch when scheduler swaps processes in the same group Operating System Concepts 8th Edition 4.64 Silberschatz, Galvin and Gagne 2009 Linux Threads s Linux refers to them as tasks rather than threads s Thread creation is done through clone() system call s clone() allows a child task to share the address space of the parent task (process) s When clone() is invoked, it is passed a set of flags that determine how much sharing take place Operating System Concepts 8th Edition 4.65 Silberschatz, Galvin and Gagne 2009 Linux Threads s Multiple user-level threads that constitute a single user-level process are mapped into kernel-level processes that share the same ID group using the clone() system call Operating System Concepts 8th Edition 4.66 Silberschatz, Galvin and Gagne 2009 End of Chapter 4 Operating System Concepts 8th Edition, Silberschatz, Galvin and Gagne 2009
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Oklahoma State - CS - 4323
Chapter 5: CPU SchedulingOperating System Concepts 8th Edition,Silberschatz, Galvin and Gagne 2009Chapter 5: CPU SchedulingBasic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems
Oklahoma State - CS - 4323
Chapter 5: CPU SchedulingOperating System Concepts 8th Edition,Silberschatz, Galvin and Gagne 2009Chapter 5: CPU SchedulingBasic ConceptsScheduling CriteriaScheduling AlgorithmsThread SchedulingMultiple-Processor SchedulingOperating Systems Examp
Oklahoma State - CS - 4323
Chapter 8: Main MemoryOperating System Concepts 8th Edition,Silberschatz, Galvin and Gagne 2009Chapter 8: Memory Managements Memory management requirementss Backgrounds Swappings Contiguous Memory Allocations Pagings Structure of the Page Tables
Ashford University - EDU - 422
1HighStakes TestingAmanda LassouedEDU 422High Stakes Testing in Special EducationJudith RichardsonJuly 17, 20112Over the past decade, states have been engaged in a variety of education reformefforts designed to improve the quality of public educ
Ryerson - CLNG - 200
$iF$[iliii1iii$iruigEfi$t'Fg$ffiig fl$Fig *ic i3*$l*glliffrgiflrrgi rigiiii tggirig s+Fiegig;$sl; rFg le +i $e l;' euriil*E;iirlii-lgglFiigtFr;l *lgrFi l iEggtiiFlr *+ii9e3H*sir-ti-*+,ii+-ii,+[liiggEEiiiigiF[gtstbqEEEg1FEffiaI1E btF?laal?g!
Ryerson - CLNG - 200
qPl6E@= (l) i=c b(D=$sE5c='E'5o -==+k :iiE e,E j-'i c(o-!tl=-(O l(:DUE o,:*[r':lQ=.&lt;*gs$5Qo =ob:t o o85.+O -*nf; gsJ+d=PQ=t'9$ d PEooPo a)Q-x +- OO^0: o \-:LHNH.0q5l5lHI5iolcnl!tlG)g=il rr 8 &lt;&gt;ogg g g+egF$*
JWU Charlotte - HISTORY - 102
February 21, 2012The American &amp;French RevolutionResults of the EnlightenmentWeakened influence and power of religious authorityWillingness to question customs/ideaEncouraged the idea that human reason can lead to progressPromoted alternative press
JWU Charlotte - HISTORY - 102
Feb.9.2012European Absolutism and the State ISovereign- MonarchyChronology Conflict between Catholic forces under Charles V vs. Protestant Prince (1540s1555) French Wars of Religion (1562-1598) Thirty Years War (1618-1648) Louis XIVs reign (1643-17
JWU Charlotte - HISTORY - 102
February 23, 2012The French Revolution1791-1799ChronologyConstitutional Monarchy (1789-1792)National Convention (1792-1795)The Terror (Sept. 1793-July 1794)French Directory (1795-1799)Radicalization of French RevolutionKings attempted escapeWars
JWU Charlotte - HISTORY - 102
Feb. 14.2012European Absolutism and the State IIEASSY 1 DUE MARCH 22, 2012Hobbes: Civil authority above religious authority Human nature makes people prone to evil/disorder Social contact once established cannot be dissolvedMassive Armies:1500s: a
JWU Charlotte - HISTORY - 102
February 16, 2012The EnlightenmentGeneral definition of the Enlightenment1650 -1789 intellectual and cultural phenomenonApplication of human reason to human affairs- Lead to individual freedom- And the construction of a prosperous just and equitable
JWU Charlotte - HISTORY - 102
The Industrial Revolution transformed Europe, it changed the way how the worldproduced goods. It also changed the societies and political views of the people of thetime. With the introduction of new technology many people that produced handcrafted good
JWU Charlotte - HISTORY - 102
The Middle Class and VictorianismHow did European And American writes describe racial competitionKipling 4/10Morel ferry 4/12
JWU Charlotte - HISTORY - 102
The Napoleonic EraChronology The Consulate 1799-1804 French Empire 1804-1815Early Life Napoleon Bonaparte Early Background Poor Nobility Military School Early Corsican PatriotFrench Revolution Changes his outlook-Saw potential in revolutionary n
JWU Charlotte - HISTORY - 102
Chronologyo Congress of Vienna (1814)o Revolution of 1830o Revolutions of 1848-9Legacy of NapoleonSpread ideals of Revolutions, especially nationalism (1830.1848)Led to a Transformation of politics:o Changes the rules of political legitimacyo Mas
JWU Charlotte - HISTORY - 102
Working class (proletariat)-Blue collar workers: factories, mills docks,-Producer of mass-produced good-Low wages compelled children and women to also workMiddle Class (bourgeoisie)-White-collar workers: banking, accounting, management, and office cl
CSU San Bernardino - SCM - 210
Salary282003230033300334003360033700343003480034900352003640035700320003160037000367003540032300367003400034800338003500035500377003760032400340003680035200379003600033800349003340036900354003520035500361003620036
CSU San Bernardino - SCM - 210
SchoolSquare Feet Natural Gas?122500 No220335 Yes326181 Yes415998 Yes529064 No629278 Yes726494 Yes820293 Yes919999 Yes1018275 Yes1121187 Yes1220772 Yes1328321 No1420863 No1514906 No1626759 Yes1716938 Yes1819442 Yes19
CSU San Bernardino - SCM - 210
Sample12345678910Obs 13.053.133.063.093.103.083.063.113.093.06Obs 23.083.073.043.083.063.103.063.083.093.11Obs 33.073.053.123.093.063.133.083.073.083.07Obs 43.113.103.113.093.073.033.103.073.073.09Obs
CSU San Bernardino - SCM - 210
Sample Observation 1 Observation 2 Observation 3 Observation 4 Observation 513.50563.50863.51443.50093.503023.48823.50853.48843.52503.503133.48973.48983.49953.51303.496943.51533.51203.49893.49003.483753.50593.51133.50113.4773
CSU San Bernardino - SCM - 210
Sample1234567891011121314151617181920Obs 13126251738412132412926231743183028401822Obs 24218302529421726341731192435254236292934Obs 32835342135362928333040253217293132312826
CSU San Bernardino - SCM - 210
Public Accountant50.258.856.358.254.255.050.959.557.051.9Financial Planner49.049.253.155.951.953.649.753.951.848.9
CSU San Bernardino - SCM - 210
Car123456789101112Additive 1 Additive 220.1218.0523.5621.7722.0322.5719.1517.0621.2321.2224.7723.8016.1617.2018.5514.9821.8720.0324.2321.1523.2122.7825.0223.70
CSU San Bernardino - SCM - 210
Income ($1000)66.365.774.059.739.860.970.451.348.757.060.261.1146.364.260.943.543.842.979.149.649.9123.892.256.279.761.757.887.561.9109.575.457.343.748.942.354.783.543.653.442.173.748.586.9109.652.695.256.56
CSU San Bernardino - SCM - 210
Holland America84.581.484.078.580.9Princess85.179.083.981.183.7Royal Caribbean84.881.884.085.987.4
CSU San Bernardino - SCM - 210
Black888079689669Jennings Swanson Wilson8788807876858268568582719985899982878584948381
CSU San Bernardino - SCM - 210
Midterm123456789101112131415Final471382512691415111013
CSU San Bernardino - SCM - 210
GolferMarvin LairdJimmy WalkerKevin ChappellKevin DukeAndrew BucklePaul ClaxtonLarry MizeChris RileyBubba WatsonCarlos FrancoRichard Johnson1st Round 2nd Round63747073727065717074697372716870706871717269
CSU San Bernardino - SCM - 210
Sales Price $245,500221,600214,000171,200278,100294,300306,600119,500184,200336,800202,000186,100293,900129,900193,300132,500126,700472,500575,000535,000208,100172,600269,600149,500189,900264,200239,000198,500435,900163,1001
CSU San Bernardino - SCM - 210
A/C/GulfFrancesJeanneLisaEmilyOpheliaRitaWilmaErnestoFlorenceHeleneDeanKarenMax Wind Speed1251106513580150150658010514560PacificDarbyFrankIsisHilaryMaxBudDanielSergioCosmeFlossieHenrietteIvoMax Wind Speed10575659
CSU San Bernardino - SCM - 210
Japan CompanySumitomo Corp.KindenHeiwaNCR JapanSuzuki MotorFuji BankSumintomo ChemicalSeibu RailwayShiseidoToho GasP/E Ratio153211812531213646663368US CompanyGannetMotorolaSchlumbergerOracle SystemsGapWinn-DixieIngersoll-Rand
CSU San Bernardino - SCM - 210
Method 1 Method 2 Difference10.29.50.79.69.8-0.29.28.80.410.610.10.59.910.3-0.410.29.30.910.610.50.11010011.210.60.610.710.20.510.69.80.8
CSU San Bernardino - SCM - 210
Method 1 Method 2 Method 3686258747367657569766857777259727062
CSU San Bernardino - SCM - 210
Dallas445489405485439449436420430405San Antonio460451435479475445429434410422425459430
CSU San Bernardino - SCM - 210
ProgramNetwork Ratings20/20ABC6030 RockNBC4448 Hours Mystery (Sat 10:00 pm)CBS5148 Hours Mystery (Sat 9:00 pm)CBS7848 Hours Mystery (Tues 10:00 pm)CBS6360 MinutesCBS13According to Jim (Tues 8:00 pm)ABC89According to Jim (Tues 8:30 p
CSU San Bernardino - SCM - 210
AirportBoston LoganChicago OHareChicago MidwayDenverFort LauderdaleHoustonLos AngelesMiamiNew York (JFK)OrlandoWashington (Dullus)200671.7868.2377.9878.7177.5977.6776.6776.2969.3979.9175.55200769.6965.8878.4075.7873.4578.687
CSU San Bernardino - SCM - 210
Delivery Service 1 Service 2124.528.0226.025.5328.032.0421.020.0518.019.5636.028.0725.029.0821.022.0924.023.51026.029.51131.030.0
CSU San Bernardino - SCM - 210
Winter Summer1828201815241632211820291223163819282018
CSU San Bernardino - SCM - 210
SalespersonABCDEFGHIJPotential24716310985Two-Year Sales13567410892
CSU San Bernardino - SCM - 210
Line 113.613.814.013.913.413.213.313.612.914.4Line 213.714.114.214.014.613.514.414.814.514.315.014.9
CSU San Bernardino - SCM - 210
Professor12345678910Current Students46831251079Recent Graduates68512379410
CSU San Bernardino - SCM - 210
GolferFred CouplesDavid DuvalErnie ElsNick FaldoTom LehmanJustin LeonardDavis Love IIIPhil MickelsonGreg NormanMark OMearaDriving Distance15496102378Putting56102738941
CSU San Bernardino - SCM - 210
No Program16910151113Company1220171961814Off-Site7142385
CSU San Bernardino - SCM - 210
Model 1 Model 285011009609209408909001050790112082010009001090890112011001200700890810900920900
CSU San Bernardino - SCM - 210
Subject12345678910No1512228107810149Yes1010121195107116
CSU San Bernardino - SCM - 210
StateArizonaColoradoFloridaIdahoIowaLouisianaMassachusettsNebraskaNorth DakotaSouth DakotaWashingtonExpenditure Student-Teacherper StudentRatio91058462116411311728710539
CSU San Bernardino - SCM - 210
CompanyMicrosoftIntelDellLucentTexas InstrumentsCisco SystemsHewlett-PackardIBMMotorolaYahooReputation12345678910Stock Purchase34129510678
CSU San Bernardino - SCM - 210
A540400490530490610B450540400410480370550C600630580490590620570
CSU San Bernardino - SCM - 210
Branch 1 Branch 21095885955850120091511959509258009507508058659451000875105010559351025975
CSU San Bernardino - SCM - 210
Writing Score635502447701405590439453337447471387464476514
CSU San Bernardino - SCM - 210
MonthYear 1 Year 2 Year 3January170180195February180205210March205215230April230245280May240265290June315330390July360400420August290335330September240260290October240270295November230255280December19522025
CSU San Bernardino - SCM - 210
YearSales1234567891021.622.925.521.923.927.531.529.728.631.4
CSU San Bernardino - SCM - 210
Year12345Month Period SalesSeptember11.71October21.90November32.74December44.20January51.45February61.80March72.03April81.99May92.32June102.20July112.13August122.43September131.90October142.13November152.
CSU San Bernardino - SCM - 210
Month123456789101112131415161718Sales293283322355346379381431424433470481549544601587644660
CSU San Bernardino - SCM - 210
Year12345678910Revenue23.121.327.434.633.843.259.564.474.299.3
CSU San Bernardino - SCM - 210
Year12345MonthSeptemberOctoberNovemberDecemberJanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecemberJanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecemberJanuaryFebruaryMarchApr
CSU San Bernardino - SCM - 210
Year2007200720072008200820082008200820082008MonthOctoberNovemberDecemberJanuaryFebruaryMarchAprilMayJuneJulyRate7.50197.42107.36827.24057.16447.07226.99976.97256.89936.8355
CSU San Bernardino - SCM - 210
WeekSales123456789101112172119231816201822201522
CSU San Bernardino - SCM - 210
Week12345678910111213141516171819202122Sales17211923181620182220152231343133283230293433
CSU San Bernardino - SCM - 210
Year1234567Quarter1234123412341234123412341234Sales61510410181571426231219282518223428212436302028403527
CSU San Bernardino - SCM - 210
Year199719981999200020012002200320042005200620072008Rating11.28.67.97.610.78.16.96.78.06.97.67.3