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.

Duncan A. Grove

dblp:92/5272 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 5 · 4 first-authorSecurity and privacy · 3 · 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.

Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › multilevel security
bell-lapadula enforcement
0.112011
PRISM: Program Replication and Integration for Seamless MILS · IEEE Symposium on Security and Privacy 2011
Systems and software security
multilevel security
0.112011
PRISM: Program Replication and Integration for Seamless MILS · IEEE Symposium on Security and Privacy 2011
Systems and software security
operating system security
0.112011
PRISM: Program Replication and Integration for Seamless MILS · IEEE Symposium on Security and Privacy 2011
Systems and software security › trusted computing
trusted computing base
0.112011
PRISM: Program Replication and Integration for Seamless MILS · IEEE Symposium on Security and Privacy 2011

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

polyinstantiation · 0.2diff transactions · 0.2
YearPublicationVenuePosition
2011 PRISM: Program Replication and Integration for Seamless MILS
abstract
We describe how to combine a minimal Trusted Computing Base (TCB) with polyinstantiated and slightly augmented Commercial Off The Shelf (COTS) software programs in separate Single Level Secure (SLS) partitions to create MultiLevel Secure (MLS) applications. These MLS applications can coordinate fine grained (intra-document) Bell LaPadula (BLP) [6] separation between information at multiple security levels. The untrusted COTS programs in the SLS partitions send at-level file edits as diff transactions to the TCB. The TCB verifies that BLP semantics will be observed and then patches these transactions into its canonical representation of the file. Finally, it releases appropriately filtered versions back to each SLS partition for re-assembly into the COTS program's standard file format. Furthermore, by judiciously restricting how the user can interact with the system the multiple SLS instantiations of the COTS program can be made to appear as if they are a single MLS instantiation. We demonstrate the utility of this approach using Microsoft Word and DokuWiki.
Chris A. Owen, Duncan A. Grove, Tristan Newby, Alex Murray, Chris North 0002, Michael Pope
IEEE Symposium on Security and Privacy2
2008 Non-delegatable authorities in capability systems
abstract
We present a novel technique, known as the non-delegatable authority (NDA), for distributing authority to unconfined subjects in capability systems that prevents them from sharing the exact same authority that they have been given with anyone else. T
Toby C. Murray, Duncan A. Grove
J. Comput. Secur.2
2007 An Overview of the Annex System
abstract
This paper describes the security and network architecture of the Annex system, a family of technologies for secure and pervasive communication and information processing that we have developed at the Australian Government's Defence Science and Technology Organisation. Our security architecture is built on top of a distributed object-capability system, which we believe provides an ideal platform for developing very high assurance devices. Our network architecture revolves around next generation networking technologies, including Mobile IPv6 and 802.11i wireless networking, but includes a small number of important extensions to improve security, robustness and mobility in the military context. A particular and unique contribution of our work is the tight integration of our very strong security architecture with next generation networking technologies. To complete the paper we describe our reference implementation of the Annex security and networking architecture, which consists of a number of devices known collectively as the Annex Ensemble.
Duncan A. Grove, Toby C. Murray, Chris A. Owen, Chris North 0002, J. A. Jones, Mark R. Beaumont, Bradley D. Hopkins
ACSAC1
2005 Analytical Models of Probability Distributions for MPI Point-to-Point Communication Times on Distributed Memory Parallel Computers
Duncan A. Grove, Paul D. Coddington
ICA3PP1
2005 Modeling message-passing programs with a Performance Evaluating Virtual Parallel Machine
Duncan A. Grove, Paul D. Coddington
Perform. Evaluation1
2005 Communication Benchmarking and Performance Modelling of MPI Programs on Cluster Computers
Duncan A. Grove, Paul D. Coddington
J. Supercomput.1
2004 Communication Benchmarking and Performance Modelling of MPI Programs on Cluster Computers
abstract
Summary form only given. We give an overview of two related tools that we have developed to provide more accurate measurement and modelling of the performance of message passing programs and communications on distributed memory parallel computers. MPIBench uses a very precise, globally synchronised clock to measure the performance of MPI communication routines, and can generate probability distributions of communication times, not just the average values produced by other MPI benchmarks. This allows useful insights into MPI communications performance of parallel computers, particularly the effects of network contention. PEVPM provides a simple, fast and accurate technique for performance modelling and prediction of message-passing parallel programs. It uses a virtual parallel machine to simulate the execution of the parallel program. The effects of network contention can be accurately modelled by sampling from the probability distributions generated by MPIBench. These tools are particularly useful on Beowulf clusters with commodity Ethernet networks, where relatively high latencies, network congestion and TCP problems can significantly affect communication performance, and can be difficult to model accurately using other tools. Experiments with example parallel programs demonstrate that PEVPM gives accurate performance predictions on Beowulf clusters. We also show that modelling communication performance using average times rather than sampling from probability distributions can give misleading results, particularly for a large number of processors.
Duncan A. Grove, Paul D. Coddington
IPDPS1
1999 DISCWorld: an environment for service-based matacomputing
Kenneth A. Hawick, Heath A. James, A. J. Silis, Duncan A. Grove, Craig J. Patten, J. A. Mathew, Paul D. Coddington, K. E. Kerry, J. F. Hercus, F. A. Vaughan
Future Gener. Comput. Syst.4