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

Paul J. Darby III

dblp:59/950 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2021
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Computer networks · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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
Distributed systems · 88% Cloud and datacenter computing · 8% Embedded and real-time systems · 5%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
checkpointing
0.222010
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing · IEEE Trans. Mob. Comput. 2010
Peer-to-peer checkpointing arrangement for mobile grid computing systems · HPDC 2007
Distributed systems
fault tolerance
0.222010
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing · IEEE Trans. Mob. Comput. 2010
Peer-to-peer checkpointing arrangement for mobile grid computing systems · HPDC 2007
Cloud and datacenter computing
quality of service
0.012010
Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing · IEEE Trans. Mob. Comput. 2010
Distributed systems
distributed coordination
0.012007
Peer-to-peer checkpointing arrangement for mobile grid computing systems · HPDC 2007
Embedded and real-time systems › real-time scheduling
quality-of-service-aware scheduling
0.012007
Peer-to-peer checkpointing arrangement for mobile grid computing systems · HPDC 2007

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

reliability-driven middleware · 0.2decentralized heuristic · 0.2markov model · 0.1heuristic algorithm · 0.1
YearPublicationVenuePosition
2021 GPU-Assisted Memory Expansion
abstract
Recent graphic processing units (GPUs) often come with large on-board physical memory to accelerate diverse parallel program executions on big datasets with regular access patterns, including machine learning (ML) and data mining (DM). Such a GPU may underutilize its physical memory during lengthy ML model training or DM, making it possible to lend otherwise unused GPU memory to applications executed concurrently on the host machine. This work explores an effective approach that lets memory-intensive applications run on the host machine CPU with its memory expanded dynamically onto available GPU on-board DRAM, called GPU-assisted memory expansion (GAME). Targeting computer systems equipped with the recent GPUs, our GAME approach permits speedy executions on CPU with large memory footprints by harvesting unused GPU on-board memory on-demand for swapping, far surpassing competitive GPU executions. Implemented in user space, our GAME prototype lets GPU memory house swapped-out memory pages transparently, without code modifications for high usability and portability. The evaluation of NAS-NPB benchmark applications demonstrates that GAME expedites monotasking (or multitasking) executions considerably by up to 2.1× (or 3.1×), when memory footprints exceed the CPU DRAM size and an equipped GPU has unused VDRAM available for swapping use.
Pisacha Srinuan, Purushottam Sigdel, Xu Yuan 0001, Lu Peng 0001, Paul J. Darby III, Christopher Aucoin, Nian-Feng Tzeng
NAS5
2021 Precise Weather Parameter Predictions for Target Regions via Neural Networks
Yihe Zhang 0001, Xu Yuan 0001, Sytske K. Kimball, Eric Rappin, Li Chen 0019, Paul J. Darby III, Tom Johnsten, Lu Peng 0001, Boisy Pitre, David M. Bourrie, Nian-Feng Tzeng
ECML/PKDD (5)6
2010 Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing
abstract
This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than in their conventional wired counterparts due to host mobility, dynamicity, less reliable wireless links, frequent disconnections, and variations in mobile systems. We've determined the globally optimal checkpoint arrangement to be NP-complete and so consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior checkpointing arrangements efficiently. With ReD, an MH (mobile host) simply sends its checkpointed data to one selected neighboring MH, and also serves as a stable point of storage for checkpointed data received from a single approved neighboring MH. ReD works to maximize the probability of checkpointed data recovery during job execution, increasing the likelihood that a distributed application, executed on the MoG, completes without sustaining an unrecoverable failure. It allows collaborative services to be offered practically and autonomously by the MoG. Simulations and actual testbed implementation show ReD's favorable recovery probabilities with respect to Random Checkpointing Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary checkpointing arrangements.
Paul J. Darby III, Nian-Feng Tzeng
IEEE Trans. Mob. Comput.1
2007 Peer-to-peer checkpointing arrangement for mobile grid computing systems
abstract
This paper deals with a novel, distributed, QoS-aware, peer-to-peer checkpointing arrangement component for Mobile Grid (MoG) computing systems middleware. Checkpointing is more crucial in MoG systems than in their wired counterparts due to node mobility and less reliable wireless links resulting in frequent and dynamic connections and disconnections. Having determined the globally optimal checkpoint arrangement to be NP-complete, we consider ReD, our Reliability Driven (ReD) protocol, employing QoS-aware heurisitcs, for constucting superior peer-to-peer checkpointing arrangements efficiently.
Paul J. Darby III, Nian-Feng Tzeng
HPDC1
1997 A novel SVC mechanism for call connection and control in ATM networks
Robert R. Henry 0002, Paul J. Darby III
Comput. Commun.2