Last update: Fri Mar 2 02:05:31 MST 2018
Top |
Symbols |
Numbers |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Uchihira:1997:HPN,
author = "Naoshi Uchihira and Shinichi Honiden and Toshibumi
Seki",
title = "Hypersequential Programming: a New Way to Develop
Concurrent Programs",
journal = j-IEEE-CONCURR,
volume = "5",
number = "3",
pages = "44--54",
month = jul # "\slash " # sep,
year = "1997",
CODEN = "IECMFX",
ISSN = "1092-3063 (print), 1558-0849 (electronic)",
ISSN-L = "1092-3063",
bibdate = "Tue Jan 16 06:04:48 MST 2001",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/ieeeconcurrency.bib",
URL = "http://dlib.computer.org/pd/books/pd1997/pdf/p3044.pdf;
http://www.computer.org/concurrency/pd1997/p3044abs.htm",
acknowledgement = ack-nhfb,
affiliation = "Toshiba Corp",
affiliationaddress = "Kawasaki, Jpn",
classification = "722.4; 723; 723.1; 723.3; 921.4",
journalabr = "IEEE Concurrency",
keywords = "Client/server systems; Computer programming;
Concurrency control; Concurrent programming; Graph
theory; Hypersequential programming; Parallel
algorithms; Parallel processing systems; Shared memory
systems; Subroutines",
}
Related entries
- algorithm,
5(1)6,
5(1)16,
5(1)26,
5(1)41,
5(1)56,
5(2)39,
5(2)74,
5(3)28,
5(3)64,
5(4)18,
5(4)69,
6(1)20,
6(1)68,
6(1)86,
6(3)42,
7(4)89,
8(4)91
- concurrency,
5(1)2,
5(1)82,
5(2)2,
5(2)39,
5(3)12,
5(3)55,
6(1)36,
6(1)94,
6(4)47,
8(3)2
- concurrent,
5(3)23,
5(3)55,
5(4)2,
6(1)36,
6(1)85,
6(3)2,
6(3)88,
6(3)89,
6(4)11,
6(4)74,
8(4)34
- control,
5(1)56,
5(2)39,
5(3)12,
5(3)55,
5(4)40,
6(1)36,
6(2)16,
6(3)42,
6(3)62,
8(3)3,
8(4)55
- graph,
5(4)18,
5(4)69
- memory,
5(1)26,
5(2)16,
7(2)56,
8(3)45
- new,
5(1)88,
5(2)5,
5(2)90,
5(3)77,
5(3)81,
5(4)13,
6(1)88,
6(1)92,
7(2)4,
7(3)2,
7(3)9,
7(4)2,
7(4)4,
7(4)75,
8(2)80,
8(3)3,
8(4)91
- parallel,
5(1)6,
5(1)26,
5(1)41,
5(1)68,
5(1)81,
5(2)5,
5(2)16,
5(2)28,
5(2)60,
5(2)74,
5(2)88,
5(3)12,
5(3)16,
5(3)28,
5(3)38,
5(3)64,
5(3)74,
5(4)7,
5(4)18,
5(4)40,
5(4)78,
5(4)81,
6(1)10,
6(1)16,
6(1)20,
6(1)36,
6(1)47,
6(1)58,
6(1)68,
6(1)79,
6(1)87,
6(2)2,
6(2)71,
6(2)92,
6(2)94,
6(3)74,
6(3)91,
6(4)78,
6(4)79,
6(4)79,
6(4)80,
7(1)79,
7(2)65,
7(2)81,
7(2)83,
7(3)91,
7(3)92,
7(3)93,
7(4)4,
7(4)11,
7(4)14,
7(4)26,
7(4)75,
7(4)88,
7(4)89,
7(4)91,
8(3)12,
8(4)12
- processing,
5(1)6,
5(1)9,
5(1)26,
5(1)41,
5(1)68,
5(2)5,
5(2)8,
5(2)16,
5(2)28,
5(2)60,
5(2)74,
5(3)5,
5(3)12,
5(3)28,
5(3)38,
5(3)64,
5(3)81,
5(4)18,
5(4)40,
6(1)20,
6(1)36,
6(1)47,
6(1)58,
6(1)68,
6(2)71,
6(2)94,
6(3)13,
6(3)74,
7(2)28,
7(4)4
- program,
5(1)26,
5(1)41,
5(2)74,
5(2)88,
5(3)12,
5(4)18,
5(4)69,
6(3)34,
6(3)88,
7(4)88,
8(1)37,
8(4)42
- programming,
5(1)9,
5(1)26,
5(1)41,
5(1)85,
5(2)16,
5(3)28,
5(3)38,
5(3)55,
5(3)64,
5(4)32,
5(4)69,
5(4)81,
6(1)47,
6(1)85,
6(2)30,
6(3)30,
6(3)52,
6(3)74,
6(3)86,
6(3)89,
6(4)11,
7(4)91,
8(1)48,
8(3)10
- shared,
5(1)26,
5(2)16,
5(4)54,
8(3)45
- theory,
5(1)81,
5(4)18,
5(4)69,
6(3)62,
7(1)79,
8(4)91
- way,
8(1)5