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

Kunio Tabata

dblp:35/4996 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—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
Parallel and multicore computing · 75% Processor architecture and microarchitecture · 25%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › multithreading
fine-grain multithreading
0.011999
StackThreads/MP: Integrating Futures into Calling Standards · PPoPP 1999
Parallel and multicore computing › parallel programming models
futures
0.011999
StackThreads/MP: Integrating Futures into Calling Standards · PPoPP 1999
Parallel and multicore computing
parallel programming models
0.011999
StackThreads/MP: Integrating Futures into Calling Standards · PPoPP 1999
Parallel and multicore computing › parallel programming runtimes
runtime systems and scheduling
0.011999
StackThreads/MP: Integrating Futures into Calling Standards · PPoPP 1999

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

frame detachment · 0.0asynchronous calls · 0.0
YearPublicationVenuePosition
1999 StackThreads/MP: Integrating Futures into Calling Standards
abstract
An implementation scheme of fine-grain multithreading that needs no changes to current calling standards for sequential languages and modest extensions to sequential compilers is described. Like previous similar systems, it performs an asynchronous call as if it were an ordinary procedure call, and detaches the callee from the caller when the callee suspends or either of them migrates to another processor. Unlike previous similar systems, it detaches and connects arbitrary frames generated by off-the-shelf sequential compilers obeying calling standards. As a consequence, it requires neither a frontend preprocessor nor a native code generator that has a builtin notion of parallelism. The system practically works with unmodified GNU C compiler (GCC). Desirable extensions to sequential compilers for guaranteeing portability and correctness of the scheme are clarified and claimed modest. Experiments indicate that sequential performance is not sacrificed for practical applications and both sequential and parallel performance are comparable to Cilk[8], whose current implementation requires a fairly sophisticated preprocessor to C. These results show that efficient asynchronous calls (a.k.a. future calls) can be integrated into current calling standard with a very small impact both on sequential performance and compiler engineering.
Kenjiro Taura, Kunio Tabata, Akinori Yonezawa
PPoPP2