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

Brian Oki

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

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

Software engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › programming paradigms
declarative programming
0.412020
Building Scalable and Flexible Cluster Managers Using Declarative Programming · OSDI 2020
Cloud and datacenter computing
cluster resource management and scheduling
0.412020
Building Scalable and Flexible Cluster Managers Using Declarative Programming · OSDI 2020

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

declarative programming · 0.9
YearPublicationVenuePosition
2020 Building Scalable and Flexible Cluster Managers Using Declarative Programming
Lalith Suresh 0001, João Loff, Faria Kalim, Sangeetha Abdu Jyothi, Nina Narodytska, Leonid Ryzhyk, Sahan Gamage, Brian Oki, Pranshu Jain, Michael Gasch
OSDI8
2019 Synthesizing Cluster Management Code for Distributed Systems
abstract
Management planes for data-center systems are complicated to develop, test, maintain, and evolve. They routinely grapple with hard combinatorial optimization problems like load balancing, placement, scheduling, rolling upgrades and configuration management. To tackle these problems, developers are left with two bad choices: (i) develop ad-hoc mechanisms for systems to solve these optimization problems, or (ii) use specialized solvers that require steep engineering effort.
Lalith Suresh 0001, João Loff, Nina Narodytska, Leonid Ryzhyk, Shmuel Sagiv, Brian Oki
HotOS6