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

Kiran J. Achyutuni

dblp:65/6855 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 77% Database system architecture and tuning · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling
priority scheduling
0.011994
Managing Multiple Disjoint Priority Orders in Priority Queues · INFOCOM 1994
Database system architecture and tuning › parallel database system
shared-nothing parallel database
0.011996
Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases · SIGMOD Conference 1996

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

processor sharing · 0.0priority mapping · 0.0
YearPublicationVenuePosition
1996 Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases
abstract
Whenever data is moved across nodes in the parallel database system, the indexes need to be modified too. Index modification overhead can be quite severe because there can be a large number of indexes on a relation. In this paper, we study two alternatives to index modification, namely OAT (One-At-a-Time page movement) and BULK (bulk page movement). OAT and BULK are two extremes on the spectrum of the granularity of data movement. OAT and BULK differ in two respects: first, OAT uses very little additional disk space (at most one extra page), whereas BULK uses a large amount of disk space. Second, BULK uses sequential prefetch I/O to optimize on the number of I/Os during index modification, while OAT does not. Using an experimental testbed, we show that BULK is an order of magnitude faster than OAT. In terms of the impact on transaction performance during reorganization, BULK and OAT perform differently: when the number of indexes to be modified is either one or two, OAT has a lesser impact on the transaction performance degradation. However, when the number of indexes is greater than two, both techniques have the same impact on transaction performance.
Kiran J. Achyutuni, Edward Omiecinski, Shamkant B. Navathe
SIGMOD Conference1
1994 Managing Multiple Disjoint Priority Orders in Priority Queues
abstract
In communication and computer systems, autonomous sources may assign priorities to their messages or jobs locally and independently. When a remote service (e.g., message transmission or RPC) is requested at a shared server, the server cannot use priority scheduling schemes effectively unless it can make a comparison between priorities defined by individual sources. The authors investigate the strategies under which the service received by requests of one source is not affected by the priority assignments at other sources. The first approach is a combination of processor-sharing and priority queue strategies. The second approach is to map locally defined priorities onto a global priority system. The performance of these approaches is examined in terms of the average response time of all requests, the average response time of the highest priority requests and a fairness measure.>
Yann-Hang Lee, Kiran J. Achyutuni
INFOCOM2