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

Shigeo Suzuki

dblp:21/123 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none

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

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

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › process management › CPU scheduling
thread scheduling
0.011997
Distributed-Thread Scheduling Methods for Reducing Page-Thrashing · HPDC 1997
Memory systems › shared memory
distributed shared memory
0.011997
Distributed-Thread Scheduling Methods for Reducing Page-Thrashing · HPDC 1997
Parallel and multicore computing › parallel programming runtimes › thread management
thread migration
0.011997
Distributed-Thread Scheduling Methods for Reducing Page-Thrashing · HPDC 1997

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

user-level threads · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1997 Distributed-Thread Scheduling Methods for Reducing Page-Thrashing
abstract
Although distributed threads on distributed shared memory (DSM) provide an easy programming model for distributed computer systems, it is not easy to build a high performance system with them, because a software DSM system is prone to page-thrashing. One way to reduce page-thrashing is to utilize thread migration, which leads to changes in page access patterns on DSM. In this paper, we propose thread scheduling methods based upon page access information and discuss an analytical model for evaluating this information. Then, we describe our implementation of distributed threads, PARSEC (Parallel software environment for workstation cluster). Using user-level threads, PARSEC implements thread migration and thread scheduling based upon the page access information. We also measure the performance of some applications with these thread scheduling methods. These measurements indicate that the thread scheduling methods greatly reduce page-thrashing and improve total system performance.
Yoshiaki Sudo, Shigeo Suzuki, Shigeki Shibayama
HPDC2