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.

David H. D. Warren

dblp:81/3197 · DBLP profile ↗
← Back
16ranked-venue papers
4as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 6Software engineering, systems software and programming languages · 5 · 1 first-authorArtificial intelligence and machine learning · 4 · 2 first-authorTheory of computation · 4Databases, data management, data science and information retrieval · 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
2 papers
Parallel and multicore computing · 83% Memory systems · 17%
Theoretical computer science
3 papers
Automata and formal languages · 63% Logic in computer science · 37%
Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 100%
Databases, data mining, and information retrieval
2 papers
Data models and query languages · 59% Query processing and optimization · 41%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming models
0.021996
Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory · HPCA 1996
Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism · PPoPP 1991
Memory systems › virtual memory management
shared virtual memory
0.011996
Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory · HPCA 1996
Parallel and multicore computing › task allocation
thread placement
0.011996
Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory · HPCA 1996
Parallel and multicore computing › parallel scheduling
thread scheduling
0.011996
Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory · HPCA 1996
Parallel and multicore computing › parallel programming models › task parallelism
and-or parallelism
0.011991
Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism · PPoPP 1991
Parallel and multicore computing › programming models
logic programming
0.011991
Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism · PPoPP 1991
Parallel and multicore computing › multiprocessor system
shared-memory multiprocessor
0.011996
Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory · HPCA 1996
Automata and formal languages › grammar formalisms › logic grammars
definite clause grammars
0.021982
Issues in Natural Language Access to Databases from a Logic Programming Perspective · ACL 1982
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks · Artif. Intell. 1980
Programming languages and type systems
logic programming
0.021991
Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism · PPoPP 1991
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks · Artif. Intell. 1980
Automata and formal languages › parsing
chart parsing
0.011983
Parsing as Deduction · ACL 1983
Programming languages and type systems › logic programming
prolog
0.011991
Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism · PPoPP 1991
Data models and query languages › natural language interface
natural language interface to database
0.011982
Issues in Natural Language Access to Databases from a Logic Programming Perspective · ACL 1982
Logic in computer science
logic programming
0.011982
Issues in Natural Language Access to Databases from a Logic Programming Perspective · ACL 1982
Query processing and optimization
interactive query processing
0.011981
Efficient Processing of Interactive Relational Data Base Queries expressed in Logic · VLDB 1981
Natural language and speech › Information extraction and text analysis
syntactic parsing
0.011980
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks · Artif. Intell. 1980
Automata and formal languages
grammar formalisms
0.011980
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks · Artif. Intell. 1980
Data models and query languages › query language design
logic-based query languages
0.011981
Efficient Processing of Interactive Relational Data Base Queries expressed in Logic · VLDB 1981

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

thread placement · 0.0system scheduling · 0.0prolog · 0.0logic programming · 0.0definite clause grammar · 0.0comparison with augmented transition networks · 0.0
YearPublicationVenuePosition
2004 The diffusion space of data diffusion architectures
Jorge Buenabad Chávez, Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
Parallel Comput.4
2003 Virtual memory on data diffusion architectures
Jorge Buenabad Chávez, Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
Parallel Comput.4
1996 Multitasking and Multithreading on a Multiprocessor with Virtual Shared Memory
abstract
In this paper we investigate the combination of multitasking and multithreading in a (virtual) shared memory parallel machine running a number of parallel applications. In particular, we investigate whether it is better to run related threads, or unrelated threads on each node to achieve the best system throughput and to complete a mix of applications as quickly as possible. The experiments provide results for a range of mixes of applications. One of our benchmarks has a clear preference to place its threads across the whole machine, while the others have a slight preference to run their threads on smaller partitions of the machine. The differences are mostly slight, suggesting that the system scheduler has considerable flexibility in thread placement without jeopardising performance.
Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
HPCA3
1995 The Application of Skewed-Associative Memories to Cache Only Memory Architectures
Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
ICPP (1)3
1995 Hiding Miss Latencies with Multithreading on the Data Diffusion Machine
Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
ICPP (1)3
1993 Scheduling Speculative Work in Or-Parallel Prolog Systems
Tony Beaumont, David H. D. Warren
ICLP2
1993 Performance of the Compiler-Based Andorra-I System
Rong Yang 0004, Tony Beaumont, Inês de Castro Dutra, Vítor Santos Costa, David H. D. Warren
ICLP5
1991 The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model
Vítor Santos Costa, David H. D. Warren, Rong Yang 0004
ICLP2
1991 The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model
Vítor Santos Costa, David H. D. Warren, Rong Yang 0004
ICLP2
1991 Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism
abstract
article Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism Share on Authors: Vítor Santos Costa View Profile , David H. D. Warren View Profile , Rong Yang View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 26Issue 7July 1991 pp 83–93https://doi.org/10.1145/109626.109635Online:01 April 1991Publication History 48citation350DownloadsMetricsTotal Citations48Total Downloads350Last 12 Months8Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Vítor Santos Costa, David H. D. Warren, Rong Yang 0004
PPoPP2
1983 Parsing as Deduction
abstract
By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. The efficiency of this approach for an interesting class of grammars is discussed.
Fernando Pereira 0003, David H. D. Warren
ACL2
1982 Issues in Natural Language Access to Databases from a Logic Programming Perspective
abstract
Americanae nace como un proyecto conjunto que surge dentro de la Red Europea de Información y Documentación sobre América Latina (REDIAL), y que ha afrontado la Biblioteca de la Agencia Española de Cooperación Internacional para el Desarrollo (AECID). Esta nueva biblioteca virtual hace más accesibles los libros digitales de tema americanista a los investigadores y usuarios interesados de cualquier parte del mundo.
David H. D. Warren
ACL1
1982 An Efficient Easily Adaptable System for Interpreting Natural Language Queries
David H. D. Warren, Fernando Pereira 0003
Am. J. Comput. Linguistics1
1981 Efficient Processing of Interactive Relational Data Base Queries expressed in Logic
David H. D. Warren
VLDB1
1980 Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks
Fernando Pereira 0003, David H. D. Warren
Artif. Intell.2
1980 Logic Programming and Compiler Writing
abstract
Abstract The concept of ‘logic programming’, and its practical application in the programming language Prolog, are explained from first principles. The ideas are illustrated by describing in detail one sizable Prolog program which implements a simple compiler. The advantages and practicability of using Prolog for ‘real’ compiler implementation are discussed.
David H. D. Warren
Softw. Pract. Exp.1