Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Page:1989:SME,
author = "I. P. Page and R. T. Jacob",
title = "The solution of mutual exclusion problems which can be
described graphically",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "45--54",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.45",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/45.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/45.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/46.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/47.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/48.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/49.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/50.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/51.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/52.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/53.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/54.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Texas Univ.",
affiliationaddress = "Richardson, TX, USA",
classcodes = "C6150J (Operating systems)",
classification = "722; 723; 921; 922; C6150J (Operating systems)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Richardson, TX,
USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "blocked processes; Blocked processes; blocked-queue
binary semaphores; Blocked-queue binary semaphores;
Computer Programming--Algorithms; Dijkstra semaphores;
disciplines; Distributed; free solutions; graph
representations; Hoare monitor; Hoare monitor, Computer
Systems, Digital; Mathematical Techniques--Graph
Theory; mutual exclusion problems; Mutual exclusion
problems; Mutual Exclusion Programs; operating systems
(computers); parallel programming;
Probability--Queueing Theory; queue; Queue disciplines;
queueing theory; starvation-; Starvation-free
solutions; synchronisation; undirected; Undirected
graph representations; Undirected Graphs; weak binary
semaphores; Weak binary semaphores",
thesaurus = "Operating systems [computers]; Parallel programming;
Queueing theory; Synchronisation",
treatment = "P Practical",
}