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

Adam Ferrari

dblp:05/3631 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2003
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-authorSecurity and privacy · 1

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 · 54% Parallel and multicore computing · 46%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming models
0.011995
TPVM: Distributed Concurrent Computing with Lighweight Processes · HPDC 1995
Parallel and multicore computing › parallel scheduling
runtime scheduling
0.011995
TPVM: Distributed Concurrent Computing with Lighweight Processes · HPDC 1995
Operating systems › resource management
process management
0.012000
Accountability and Control of Process Creation in Metasystems · NDSS 2000

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

message passing · 0.0dataflow scheduling · 0.0
YearPublicationVenuePosition
2003 Support for extensibility and site autonomy in the Legion grid system object model
Michael J. Lewis, Adam Ferrari, Marty Humphrey, John F. Karpovich, Mark M. Morgan, Anand Natrajan, Anh Nguyen-Tuong, Glenn S. Wasson, Andrew S. Grimshaw
J. Parallel Distributed Comput.2
2000 Accountability and Control of Process Creation in Metasystems
Marty Humphrey, Frederick Knabe, Adam Ferrari, Andrew S. Grimshaw
NDSS3
1998 JPVM: network parallel computing in Java
abstract
The JPVM library is a software system for explicit message-passing-based parallel programming in Java. The library supports an interface similar to the C and Fortran interface of the parallel virtual machine (PVM) system, with modifications to better suit Java programming styles. The similarity between JPVM and the widely used PVM system supports a quick learning curve for experienced PVM programmers. At the same time, JPVM offers novel features not found in standard PVM such as thread safety, multiple communication end-points per task, and default-case direct message routing. JPVM is implemented entirely in Java, and is thus highly portable among platforms supporting a version of the Java Virtual Machine. This feature opens up the possibility of utilizing resources such as Macintosh and Windows based workstations, which are commonly excluded from network parallel computing systems. Initial applications performance results achieved with a prototype JPVM system indicate that the Java-implemented approach can offer good performance at appropriately coarse granularities. © 1998 John Wiley & Sons, Ltd.
Adam Ferrari
Concurr. Pract. Exp.1
1998 Multiparadigm distributed computing with TPVM
abstract
Distributed concurrent computing based on lightweight processes can potentially address performance and functionality limits in heterogeneous systems. The TPVM framework, based on the notion of ‘exportable services’, is an extension to the PVM message-passing system, but uses threads as units of computing, scheduling, and parallelism. TPVM facilitates and supports three different distributed concurrent programming paradigms: (a) the traditional, task based, explicit message-passing model; (b) a data-driven instantiation model that enables straightforward specification of computation based on data dependencies; and (c) a partial shared-address space model via remote memory access, with naming and typing of distributed data areas. The latter models offer significantly different computing paradigms for network-based computing, while maintaining a close resemblance to, and building upon, the conventional PVM infrastructure in the interest of compatibility and ease of transition. The TPVM system comprises three basic modules: a library interface that provides access to thread-based distributed concurrent computing facilities, a portable thread interface module which abstracts the required thread-related services, and a thread server module which performs scheduling and system data management. System implementation as well as applications experiences have been very encouraging, indicating the viability of the proposed models, the feasibility of portable and efficient threads systems for distributed computing, and the performance improvements that result from multithreaded concurrent computing. © 1998 John Wiley & Sons, Ltd.
Adam Ferrari, Vaidy S. Sunderam
Concurr. Pract. Exp.1
1995 TPVM: Distributed Concurrent Computing with Lighweight Processes
abstract
The TPVM (Threads-oriented PVM) system, is an experimental auxiliary subsystem for the PVM distributed system, which supports the use of lightweight processes or "threads" as the basic unit of parallelism and scheduling. TPVM provides a library interface which presents both a traditional, task based, explicit message passing model, as well as a data-driven scheduling model that enables straightforward specification of computation based on data dependencies. Our system design is still under development, but a prototype implementation has allowed us to perform a number of preliminary experiments. These have provided strong evidence that TPVM can offer improved performance, processor utilization, and load balance to several application categories. Through our experiments we have also determined that the current TPVM design is not very well suited to certain types of applications, most notably highly synchronous, SPMD-style algorithms.
Adam Ferrari, Vaidy S. Sunderam
HPDC1
1994 Failure-Resilient Computations in the EcliPSe System
abstract
Local or wide-area connected workstation cluster-based computation systems are inherently failure-prone, particularly for long running computations. In this work we introduce a variety of features for failure resilience in the EcliPSe system for replicative applications. Key characteristics of fault-tolerant EcliPSe are ease of use, low statesaving costs, system scalability and good performance.
Felipe Knop, Vernon Rego, Vaidy S. Sunderam, Adam Ferrari
ICPP (3)4