Stamms (author)
Author, followers, and translators associated with this PostIt.
| Thumbnail | Username | Role | Balance | Deadline | Emailed | Closed | |
|---|---|---|---|---|---|---|---|
|
Dieter Author | Dieter@oli-it.com | Author | $5.00 | - | Yes | Yes |
Codes (Descriptions)
| Comment | Status | Scanned | Receivers | |
|---|---|---|---|---|
| Code von Dieter | 2 | No | 4 | view |
Angler (Matching)
| Angler | Status | Matched Time | Read Time | |
|---|---|---|---|---|
| Studium | - | 2006-07-28 15:23 | - | view |
| Informatik | - | 2005-06-03 23:12 | - | view |
| Informatik | - | 2004-03-20 04:09 | - | view |
| Informatik | - | 2003-08-08 02:08 | - | view |
TopLabs (Answers)
| Thumbnail | TopLab | Author | Date | Reward |
|---|---|---|---|---|
| Na, klar! Mit Hilfe eines Semaphors mit Anfangswert n kann man erreichen, dass sich immer nur höchstens n Prozesse im kritischen Bereich befinden: semaphore ex; ex := n; Prozess Pi (i = 1, 2, 3, ...) P(ex); <kritischer Bereich>; V(ex) | Ali | 2002-05-21 | $7.83 |