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 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329
|
package examples.pilib
/**
* From Pi to Scala: Semaphores, monitors, read/write locks.
* Readers/writers locks.
*/
object rwlock {
import scala.concurrent.pilib._
class Signal extends Chan[unit] {
def send = write(())
def receive = read
}
class CountLock {
private val busy = new Signal
def get = busy.send
def release = busy.receive
spawn < release >
}
/** A binary semaphore
*/
class Lock {
private val busy = new Signal;
private val free = new Signal;
def get = busy.send;
def release = free.send;
spawn < (while (true) {
choice (
busy * (x => free.receive),
free * (x => ())
)
}) >
}
/** A monitor a la Java
*/
class JavaMonitor {
private val lock = new Lock
private var waiting: List[Signal] = Nil
def Wait = {
val s = new Signal
waiting = s :: waiting
lock.release
s.receive
lock.get
}
def Notify =
if (!waiting.isEmpty) {
waiting.head.send
waiting = waiting.tail
}
def NotifyAll =
while (!waiting.isEmpty) {
waiting.head.send
waiting = waiting.tail
}
def await(cond: => boolean): unit =
while (false == cond) (Wait)
}
/*
class Buffer[a](size: Int) extends JavaMonitor with {
var in = 0, out = 0, n = 0;
val elems = new Array[a](size);
def put(x: a) = synchronized {
await(n < size);
elems(out) = x;
out = (out + 1) % size;
}
def get: a = synchronized {
await(n > 0);
val x = elems(in);
in = (in + 1) % size;
x
}
}
*/
/** A readers/writers lock. */
trait ReadWriteLock {
def startRead: unit
def startWrite: unit
def endRead: unit
def endWrite: unit
}
/**
* A readers/writers lock, using monitor abstractions.
*/
class ReadWriteLock1 extends JavaMonitor with ReadWriteLock {
private var nactive: int = 0
private var nwriters: int = 0
def status =
System.out.println(nactive + " active, " + nwriters + " writers");
def startRead = synchronized {
await(nwriters == 0)
nactive = nactive + 1
status
}
def startWrite = synchronized {
nwriters = nwriters + 1
await(nactive == 0)
nactive = 1
status
}
def endRead = synchronized {
nactive = nactive - 1
if (nactive == 0) NotifyAll
status
}
def endWrite = synchronized {
nwriters = nwriters - 1
nactive = 0
NotifyAll
status
}
}
/** A readers/writers lock, using semaphores
*/
class ReadWriteLock2 extends ReadWriteLock {
private var rc: int = 0 // reading readers
private var wc: int = 0 // writing writers
private var rwc: int = 0 // waiting readers
private var wwc: int = 0 // waiting writers
private val mutex = new Lock
private val rsem = new Lock
private val wsem = new Lock
def startRead = {
mutex.get;
if (wwc > 0 || wc > 0) {
rwc = rwc + 1;
mutex.release;
rsem.get;
rwc = rwc - 1
}
rc = rc + 1;
if (rwc > 0) rsem.release;
mutex.release
}
def startWrite = {
mutex.get;
if (rc > 0 || wc > 0) {
wwc = wwc + 1;
mutex.release;
wsem.get;
wwc = wwc - 1
}
wc = wc + 1;
mutex.release
}
def endRead = {
mutex.get;
rc = rc - 1;
if (rc == 0 && wwc > 0) wsem.release;
mutex.release
}
def endWrite = {
mutex.get;
wc = wc - 1;
if (rwc > 0)
rsem.release
else if (wwc > 0) wsem.release;
mutex.release
}
}
/** A readers/writers lock, using channels, without priortities
*/
class ReadWriteLock3 extends ReadWriteLock {
private val sr = new Signal
private val er = new Signal
private val sw = new Signal
private val ew = new Signal
def startRead = sr.send
def startWrite = sw.send
def endRead = er.send
def endWrite = ew.send
private def rwlock: unit = choice (
sr * (x => reading(1)),
sw * (x => { ew.receive; rwlock })
)
private def reading(n: int): unit = choice (
sr * (x => reading(n+1)),
er * (x => if (n == 1) rwlock else reading(n-1))
)
spawn < rwlock >
}
/** Same, with sequencing
*/
class ReadWriteLock4 extends ReadWriteLock {
private val rwlock = new ReadWriteLock3
private val sr = new Signal
private val ww = new Signal
private val sw = new Signal
def startRead = sr.send
def startWrite = { ww.send; sw.send }
def endRead = rwlock.endRead
def endWrite = rwlock.endWrite
private def queue: unit = choice (
sr * (x => { rwlock.startRead ; queue }),
ww * (x => { rwlock.startWrite; sw.receive; queue })
)
spawn < queue >;
}
/** Readwritelock where writers always have priority over readers
*/
class ReadWriteLock5 extends ReadWriteLock {
private val sr = new Signal
private val er = new Signal
private val ww = new Signal
private val sw = new Signal
private val ew = new Signal
def startRead = sr.send
def startWrite = { ww.send; sw.send }
def endRead = er.send
def endWrite = ew.send
private def Reading(nr: int, nw: int): unit =
if (nr == 0 && nw == 0)
choice (
sr * (x => Reading(1, 0)),
ww * (x => Reading(0, 1))
)
else if (nr == 0 && nw != 0) {
sw.receive;
Writing(nw);
}
else if (nr != 0 && nw == 0)
choice (
sr * (x => Reading(nr + 1, 0)),
er * (x => Reading(nr - 1, 0)),
ww * (x => Reading(nr, 1))
)
else if (nr != 0 && nw != 0)
choice (
ww * (x => Reading(nr, nw + 1)),
er * (x => Reading(nr - 1, nw))
);
private def Writing(nw: int): unit = choice (
ew * (x => Reading(0, nw - 1)),
ww * (x => Writing(nw + 1))
);
spawn < Reading(0, 0) >;
}
/**
* Main function.
*/
def main(args: Array[String]): unit = {
val random = new java.util.Random()
def reader(i: int, rwlock: ReadWriteLock): unit = {
Thread.sleep(1 + random.nextInt(100))
System.err.println("Reader " + i + " wants to read.")
rwlock.startRead
System.err.println("Reader " + i + " is reading.")
Thread.sleep(1 + random.nextInt(100))
rwlock.endRead
System.err.println("Reader " + i + " has read.")
reader(i, rwlock)
}
def writer(i: int, rwlock: ReadWriteLock): unit = {
Thread.sleep(1 + random.nextInt(100))
System.err.println("Writer " + i + " wants to write.")
rwlock.startWrite
System.err.println("Writer " + i + " is writing.")
Thread.sleep(1 + random.nextInt(100))
rwlock.endWrite
System.err.println("Writer " + i + " has written.")
writer(i, rwlock)
}
val n = try { Integer.parseInt(args(0)) } catch { case _ => 0 }
if (n < 1 || 5 < n) {
Console.println("Usage: scala examples.pilib.rwlock <n> (n=1..5)")
exit
}
val rwlock = n match {
case 1 => new ReadWriteLock1
case 2 => new ReadWriteLock2
case 3 => new ReadWriteLock3
case 4 => new ReadWriteLock4
case 5 => new ReadWriteLock5
}
List.range(0, 5) foreach (i => spawn < reader(i, rwlock) >)
List.range(0, 5) foreach (i => spawn < writer(i, rwlock) >)
}
}
|