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.

J. Dana Eckart

dblp:21/3486 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 44% Storage systems · 44% Distributed systems · 13%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines › garbage collection
distributed garbage collection
0.011987
Distributed garbage collection · PLDI 1987
Runtime systems and virtual machines
garbage collection
0.011987
Distributed garbage collection · PLDI 1987
Memory systems › shared memory › distributed shared memory
distributed memory management
0.011987
Distributed garbage collection · PLDI 1987
Storage systems › storage management
storage reclamation
0.011987
Distributed garbage collection · PLDI 1987
Distributed systems
distributed object systems
0.011987
Distributed garbage collection · PLDI 1987

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

XSLT · 0.1XML · 0.1reference counting · 0.0mark-sweep · 0.0copying collection · 0.0
YearPublicationVenuePosition
2005 PIML: the Pathogen Information Markup Language
abstract
MOTIVATION: A vast amount of information about human, animal and plant pathogens has been acquired, stored and displayed in varied formats through different resources, both electronically and otherwise. However, there is no community standard format for organizing this information or agreement on machine-readable format(s) for data exchange, thereby hampering interoperation efforts across information systems harboring such infectious disease data. RESULTS: The Pathogen Information Markup Language (PIML) is a free, open, XML-based format for representing pathogen information. XSLT-based visual presentations of valid PIML documents were developed and can be accessed through the PathInfo website or as part of the interoperable web services federation known as ToolBus/PathPort. Currently, detailed PIML documents are available for 21 pathogens deemed of high priority with regard to public health and national biological defense. A dynamic query system allows simple queries as well as comparisons among these pathogens. Continuing efforts are being taken to include other groups' supporting PIML and to develop more PIML documents. AVAILABILITY: All the PIML-related information is accessible from http://www.vbi.vt.edu/pathport/pathinfo/
Yongqun He, Richard R. Vines, Alice R. Wattam, Georgiy V. Abramochkin, Allan Dickerman, J. Dana Eckart, Bruno W. S. Sobral
Bioinform.6
1987 Distributed garbage collection
abstract
There are two basic approachs to the problem of storage reclamation, process- and processor-based, named for the view point used to recognize when a particular piece of storage can be reclaimed. Examples of the processor approach include mark/sweep and copying algorithms and their variants, while reference counting schemes use a process view of the collection. It is argued that the process approach is better suited for distributed computation where links between dynamically allocated objects may cross processor boundaries. In addition, the process approach allows the heap to be more conveniently shared with other processes in those cases when different processes might not have their own virtual address spaces. A new algorithm using the process approach is given. Its space requirement per object is better than that for reference counting. In addition, a restricted form of pointer replacement is supported which allows circular structures so constructed to be properly collected.
J. Dana Eckart, Richard J. LeBlanc
PLDI1
1987 Overloading in the Ada Language: Is ist Too Restrictive?
J. Dana Eckart, Richard J. LeBlanc
Comput. Lang.1