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

Rüdiger Jakob

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

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

Systems, architecture and hardware · 2

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

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › concurrent programming languages
parallel language constructs
0.011993
Language Portability Across Shared Memory Multiprocessors · IEEE Trans. Parallel Distributed Syst. 1993
Parallel and multicore computing › parallel computing
parallel programming languages
0.011993
Language Portability Across Shared Memory Multiprocessors · IEEE Trans. Parallel Distributed Syst. 1993
Parallel and multicore computing › multiprocessor system
shared-memory multiprocessor
0.011993
Language Portability Across Shared Memory Multiprocessors · IEEE Trans. Parallel Distributed Syst. 1993

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

synchronization primitives · 0.0macro processor · 0.0
YearPublicationVenuePosition
1993 Language Portability Across Shared Memory Multiprocessors
abstract
Explains why the Force parallel programming language has been easily portable between eight different shared memory multiprocessors. The authors show how a two-layer macro processor allows them to hide machine dependencies and to build machine-independent high-level language constructs. The importance of packaging low-level synchronization operations is demonstrated by a proof of mutual exclusion for asynchronous variable operations. The Force constructs enable one to write portable parallel programs largely independent of the number of processes executing them.>
Gita Alaghband, Muhammad S. Benten, Rüdiger Jakob, Harry F. Jordan, Aruna V. Ramanan
IEEE Trans. Parallel Distributed Syst.3
1989 The Force: A Highly Portable Parallel Programming Language
Harry F. Jordan, Muhammad S. Benten, Gita Alaghband, Rüdiger Jakob
ICPP (2)4