Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

T. J. Reynolds

dblp:99/3783 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › programming models
logic programming		 0.011989
A Message Driven Or-Parallel Machine · ASPLOS 1989
Parallel and multicore computing › parallel programming models › task parallelism
OR-parallelism		 0.011989
A Message Driven Or-Parallel Machine · ASPLOS 1989
Parallel and multicore computing › parallel architecture
parallel machine design		 0.011989
A Message Driven Or-Parallel Machine · ASPLOS 1989

Methods — techniques the papers use, named apart from their topics

functional simulation · 0.0abstract machine · 0.0
YearPublicationVenuePosition
1995 PACE: Fine-Grained Parallel Graph Reducion
T. J. Reynolds, M. E. Waite, F. Z. Ieromnimon
 ICPP (1)1
1990 OR-Parallel Prolog and Search Problems in AI Applications
T. J. Reynolds, Petros Kefalas
 ICLP1
1989 A Message Driven Or-Parallel Machine
abstract
A message driven architecture for the execution of OR-parallel logic languages is proposed. The computational model is based on well known compilation techniques for Logic Languages. We present first the multiple binding mechanism for the OR-parallel Prolog architecture and the corresponding OR-parallel abstract machine is described. A scheduling algorithm which does not rely upon the availability of global data structures to direct the search for work is discussed. The message driven processor, the processing node of the parallel machine, is designed to interact with a shared global address space and to efficiently process messages from other processing nodes. We discuss some of the results obtained from a high level functional simulator of the message driven machine.
Sergio A. Delgado-Rannauro, T. J. Reynolds
 ASPLOS2
1988 BRAVE - a parallel logic language for artificial intelligence
T. J. Reynolds, A. J. Beaumont, Anthony S. K. Cheng, Sergio A. Delgado-Rannauro, L. A. Spacek
 Future Gener. Comput. Syst.1