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

Robert E. Felderman

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

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

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 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
1 paper
Distributed systems · 62% Parallel and multicore computing · 38%
Computer networks
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.011989
The Benevolent Bandit Laboratory: a testbed for distributed algorithms · IEEE J. Sel. Areas Commun. 1989
Wireless networking › medium access control
carrier sense multiple access
0.011987
Extension to the Rude-CSMA Analysis · IEEE Trans. Commun. 1987
Wireless networking
multiple access protocols
0.011987
Extension to the Rude-CSMA Analysis · IEEE Trans. Commun. 1987
Parallel and multicore computing › parallel computing
parallel applications
0.011989
The Benevolent Bandit Laboratory: a testbed for distributed algorithms · IEEE J. Sel. Areas Commun. 1989
Parallel and multicore computing › parallel algorithms › sorting
parallel merge sort
0.011989
The Benevolent Bandit Laboratory: a testbed for distributed algorithms · IEEE J. Sel. Areas Commun. 1989

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

distributed algorithm · 0.0
YearPublicationVenuePosition
1993 ATOMIC: A Low-Cost, Very-High-Speed, Local Communication Architecture
abstract
ATOMIC1 is an inexpensive O(gigabit) speed LAN built by USC/ISI. It is based upon Mosaic technol ogy developed for fine-grain, message-passing, massively parallel computation. Each Mosaic processor is capable of routing variable length packets, while providing added value through simultaneous computing and buffering. ATOMIC adds a general routing capability to the native Mosaic wormhole routing through store-and-forward. ATOMIC scales linearly, with a small interface cost. Each ATOMIC channel has a data carrying capacity of 500Mbls. A prototype ATOMIC LAN has been con structed along with host interfaces and software that pro vides full TCP/IP compatibility. Using ATOMIC, 1J00 byte packets have been exchanged between hosts at an aggregate transfer rate of more than lGbls. Other tests have demonstrated throughput of 5.25 million packets per second over a single Mosaic channel. This paper describes the architecture and performance of ATOMIC.
Danny Cohen, Gregory G. Finn, Robert E. Felderman, Annette L. DeSchon
ICPP (1)3
1989 The Benevolent Bandit Laboratory: a testbed for distributed algorithms
abstract
The design, implementation, and use of a distributed processing environment on a network of IBM PCs running DOS is described. Temporarily unused PCs can be accessed by other users on the network to perform distributed computations. An owner of a PC need not be aware that the machine is being used during idle times; the machine is immediately returned when the owner begins to work again. Some degree of computation resiliency is provided in this unreliable environment; if a PC is part of a distributed algorithm and is reclaimed by its owner, the system finds a replacement node (if possible), resends the affected code to the processor, and restarts it. Thus, a distributed computation is able to proceed despite a set of transient processors. System performance, distributed applications, and fault tolerance are discussed. Performance improvements are demonstrated by applications like parallel merge sort and a distributed search solution to the eight puzzle.>
Robert E. Felderman, Eve M. Schooler, Leonard Kleinrock
IEEE J. Sel. Areas Commun.1
1987 Extension to the Rude-CSMA Analysis
abstract
This paper extends the rude-CSMA analysis by removing the restriction that each node have the same average arrival rate and average service time. Additionally, some minor errors are corrected.
Robert E. Felderman
IEEE Trans. Commun.1