-
Notifications
You must be signed in to change notification settings - Fork 0
/
00241.html
30 lines (26 loc) · 950 Bytes
/
00241.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>00241.mbox</title>
</head>
<body>
<div><strong>From</strong>: nisse@lysator.liu.se</div>
<div><strong>Date</strong>: Tue, 16 Jul 2002 16:09:16 +0200</div>
<hr/>
<pre>rreale@iol.it writes:
> But how much performance imprevement would we achieve if we created such
> a mechanism, only for pure data?
The fastest way to do it that I can imagine, for the simplest case of
mutually trusting processes, is to have a (possibly) short message
queue, protected by a mutex and some condition variables, all in th
eshared memory page. It's not obvious to me if that will be slower or
faster than L4 ipc that can pass the data in registers.
Furthermore, I have never implemented mutexes and condition variables,
but I wouldn't be surprised if some syscall is needed for conditions
to propagate between threads or processes.
Regards,
/Niels
</pre>
</body>
</html>