diff options
| -rw-r--r-- | Media.wiki | 16 | ||||
| -rw-r--r-- | Pintos.wiki | 24 | ||||
| -rw-r--r-- | TaskApp.wiki | 22 | ||||
| -rw-r--r-- | Terminal Driver.wiki | 6 |
4 files changed, 68 insertions, 0 deletions
@@ -5,6 +5,18 @@ Teolog == Books == - Player Piano - https://pragprog.com/book/tpp20/the-pragmatic-programmer-20th-anniversary-edition +- lambda the ultimate +- [[http://www.paulgraham.com/onlisp.html|On Lisp]] +- "List Processing in Real Time on a Serial Computer" by Henry Baker +- Haskell from first principles +- The city of ember +- American Gods, Neil Gaiman +- The Disappearing Spoon, Sam Kean +- Hunger games prequel +- The Mythical Man Month +- Lőkar? + - https://www.thedarkweblinks.com/deep-web-books-sites-links/ + - https://www.reddit.com/r/onions/comments/3ya4vi/best_onions_to_get_free_ebooks_and_pdfs/ == Movies == Filmer jag vill eller har sätt, samt möjligen korta recensioner av @@ -17,12 +29,16 @@ Bra, men jag är inte 6 längre. Om gravid tonåring === Liar, Liar === +=== Black Mirror === === The Act === TV-Serie, HBO Åtminstånde ett avsnitt handlar om den där tjejen som psykologikst misshandlas av sin mor. +=== HG Wells (War of the Worlds (?), The Time Machine) === +film och bok? + === American ultra === === The Princess Bride === === Last Action Hero === diff --git a/Pintos.wiki b/Pintos.wiki index 05f6d26..feddc40 100644 --- a/Pintos.wiki +++ b/Pintos.wiki @@ -96,6 +96,7 @@ void barrier( void ) } }}} +*2 poäng* 2. @@ -127,6 +128,8 @@ counter to hit 2, which it never will. | increment counter | | 0 + 1 | | store counter | | 0 + 1 | +*2 poäng* + 3. Today, many processors offer some type of atomic operation(s). Can you use here an atomic fetch_and_add operation instead of the mutex lock to guarantee @@ -150,6 +153,8 @@ void barrier( void ) A fetch and add intstruction should behave just as our above example with a lock around the modification. +*2 poäng* + 4. Suggest a suitable way to extend the (properly synchronized) code from question 2 to avoid busy waiting. Show the resulting pseudocode. @@ -177,6 +182,8 @@ void barrier( void ) } }}} +*1 poäng* + 5. Consider the following (Unix) C program. @@ -198,6 +205,8 @@ void barrier( void ) 3 +*1 poäng* + 6. Every process is associated with a number of areas in memory used to store the @@ -213,6 +222,8 @@ void barrier( void ) | The memory used to store a local variable declared in a function | stack | | | | +*3 poäng* + 7. Give an example of a situation (table with jobs) where the SJF @@ -254,6 +265,10 @@ wait for all the shorter processes. Giving the following wait times. | 4 | 1 | Which is an average of ≈ 250 time units. Which is significantly lower than 1000. +*.5 poäng* + *Comment*: the idea is right, but calculated the waiting time instead of turnaround + + 8. Banker's algorithm is a deadlock [detecting] algorithm. Freedom from deadlocks @@ -262,6 +277,7 @@ only so-called [safe] states will be reached by checking every resource allocation request. If a resource allocation leads to an undesired state, the request is [rejected]. +*1.5 poäng* == 9. Explain how paging supports sharing of memory between processes. == @@ -274,6 +290,8 @@ into memory for each process (except the smaller memory usage). Memory pages can also manually be mapped into multiple processes (e.g. mmap), and then be used as a shared data area. +*1 poäng* + 10. Explain why page faults occur, under what circumstances and what happens after. Describe the set of events step by step, considering also the @@ -284,3 +302,9 @@ and then be used as a shared data area. A page fault occurs when a process attempts to access memory in a currently unmapped page. +*1 poäng* + *Comment*: it is right, but missing more information on why do + they occur and when. Missing the second part ( handling of page + faults) completely. + + diff --git a/TaskApp.wiki b/TaskApp.wiki index f356f41..4b550eb 100644 --- a/TaskApp.wiki +++ b/TaskApp.wiki @@ -1,3 +1,4 @@ += Part 1 = notation: @@ -51,3 +52,24 @@ create table updates ( title text not null, body text ); + += Part 2 = +[ ] Possibly database, with sepparate frontend + I want multiple frontends. + The goal would be to have easy access from + the notes anywhere, be it a terminal, a web + browser or a smartphone. + I probably want the terminal based to act + something like a mix between mutt and git + commit trees. + - Vim Frontend + Probably a bad idea. So much of the time + would be spend converting between the text + file and the database spec. + - Curses based + Something like mutt +- overview + I want a calendar view, even if the program is + an agenda manager in its core. + += Part 3 = diff --git a/Terminal Driver.wiki b/Terminal Driver.wiki index 8cced3c..1e26b27 100644 --- a/Terminal Driver.wiki +++ b/Terminal Driver.wiki @@ -19,6 +19,11 @@ och PDF. - https://lwn.net/images/pdf/LDD3/ch18.pdf +== Device-träd == +Barn-nod kan få access till sin förälder, eller vice versa? +Därifrån få tag på device-enheten. + + == Skärm == === `GTC-16041` === - [[https://manualzz.com/doc/17344723/hebei-jiya-electronics-gtc-16041-tr6noc--75-512-11-|Möljgt datablad]] @@ -191,3 +196,4 @@ compatible field $ fdtdump /boot/bcm2708-rpi-b-plus.dtb $ dtc -I dts -O dtb -o ov.dtbo overlay.dts }}} + |