CS343-Parallel Programming

Coroutine의 구성요소execution locationstarting at the beginning of the coroutine and remembered at each suspendexecution stateeach coroutine has its own st

exceptions must be generated from a specific kind of type.this is unlike other languages where anything can be thrownsupports two kinds of raising: th

Fringe is the leaf nodes order sensitive.How can you determine if two trees have same Fringe?The best way is to take advantage of coroutine stack to r

full coroutine has cyclesThe simpliest coroutine!resume() makescurrent coroutine inactive'this' coroutine activeWhen Fc resumes in main > mem() or mai

There are many languages that has coroutine.Coroutine comes in two forms:stackless: uses callers stackstackful: creates its own stackPython has stackl

Threadindependent sequential execution path through a program'a conceptual dot' that navigates through you code!Processa program component (like a rou

Primary reason for doing concurrency is to implement parallelism to speed up the processBecause of the communication and syncronization steps, usually

communication between threads must be as short as possible.thread terminates whenfinishes normallyfinishes with an errorkilled by parent/sibling - not

5.16 Mutual Exclusion Guarantees a critical section from being experiencing race conditions. Rules of mutual exclusion: safety - one thread can be

thread with n priority will first scan higher priority boards for any intent/usage of CS,then looks for intent/usage of lower priorities.there are n a

there is spining lock, blocking lock.spining lock is busy waiting, so it is expensiveblocking lock checks for lock once and goes to sleep if not avail

used to solely to block tasks to wait up for synchronization.The weakest form of blocking lock as its only state is list of blocked tasks.acquiring ta

It is syncronization lock.It cannot be used for mutual exclusionThe barrier has some state within it.some counterssome flags!some more informationmost

Make the 5 lines execute as fast as possible, but end up in same result as it would have executed sequenciallyS1: independentS2: independentS3: depend

Locking patterns are used to handle complicated critical sections.Split binary semaphorehave group of semaphorestreat them as if they are single binar

Occurs when there is missing:synchronizationmutual exclusionCan be very difficult to locateHow well you can spot a race condition is an index of how g

Can we get some help from the compiler for concurrency errors?Declare which variables are to be shared:The program will not even compile if you lock a

External scheduling is not as powerful as internal scheduling.You cannot access information within the routineif you need to wait after cooperation, y

8.7 Monitor Types explicit scheduling you indicate a task to wait or resume internal scheduling (uCondition) external scheduling (accept) im

A task is like a coroutine but it creates its own thread.And only one thread is active in the Task object.Case Analysis of Objects:A task may want to

In uC++, S(signaller) > W(signalled) > C(calling)This is not a uC++ schedulerWe can optimize and get rid of the queue for S.W is a stack instead of a

If you get three different futures from three different servers, what order do you wait on?what if you want to work on whatever results that finishes

We need to understand about coroutine code generation, and how it works with hardwares.Why don't you always compile your program with optimization fla

This is not a general solution.There is some internal locking going on behind the scene.CAA basically says the following:I want the val to be changed