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

Mayukh Saubhasik

dblp:63/4024 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 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.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 44% Query processing and optimization · 44% Database system architecture and tuning · 13%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
column store
0.212013
Enhancements to SQL server column stores · SIGMOD Conference 2013
Query processing and optimization › query execution › query operator implementation
vectorized query execution
0.212013
Enhancements to SQL server column stores · SIGMOD Conference 2013
Operating systems › resource management › process management
CPU scheduling
0.112009
Fair and timely scheduling via cooperative polling · EuroSys 2009
Operating systems › resource management › process management › CPU scheduling
hierarchical scheduling
0.112009
Fair and timely scheduling via cooperative polling · EuroSys 2009
Embedded and real-time systems
real-time scheduling
0.112009
Fair and timely scheduling via cooperative polling · EuroSys 2009
Embedded and real-time systems › real-time scheduling
timing-constrained scheduling
0.112009
Fair and timely scheduling via cooperative polling · EuroSys 2009

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

cooperative polling · 0.2application-level event scheduling · 0.2column store index · 0.2batch processing · 0.2
YearPublicationVenuePosition
2013 Enhancements to SQL server column stores
abstract
SQL Server 2012 introduced two innovations targeted for data warehousing workloads: column store indexes and batch (vectorized) processing mode. Together they greatly improve performance of typical data warehouse queries, routinely by 10X and in some cases by a 100X or more. The main limitations of the initial version are addressed in the upcoming release. Column store indexes are updatable and can be used as the base storage for a table. The repertoire of batch mode operators has been expanded, existing operators have been improved, and query optimization has been enhanced. This paper gives an overview of SQL Server's column stores and batch processing, in particular the enhancements introduced in the upcoming release.
Per-Åke Larson, Cipri Clinciu, Campbell Fraser, Eric N. Hanson, Mostafa Mokhtar, Michal Nowakiewicz, Vassilis Papadimos, Susan Price, Srikumar Rangarajan, Remus Rusanu, Mayukh Saubhasik
SIGMOD Conference11
2009 Fair and timely scheduling via cooperative polling
abstract
Advances in hardware capacity, especially I/O devices such as cameras and displays, are driving the development of applications like high-definition video conferencing that have tight timing and CPU requirements. Unfortunately, current operating systems do not adequately provide the timing response needed by these applications. In this paper, we present a hierarchical scheduling model that aims to provide these applications with tight timing response, while at the same time preserve the strengths of current schedulers, namely fairness and efficiency. Our approach, called cooperative polling, consists of an application-level event scheduler and a kernel thread scheduler that cooperate to dispatch time-constrained application events accurately and with minimal kernel preemption, while still ensuring rigorously that all applications share resources fairly. Fairness is enforced in a flexible manner, allowing sharing according to a mixture of both traditional resource-centric metrics and new application-centric metrics, the latter being critical to support graceful application-level adaptation in overload. Unlike traditional real-time systems, our model does not require specification or estimation of resource requirements, simplifying its usage dramatically. Our evaluation, using an adaptive video application and a graphics server, shows that our system has event dispatch accuracies that are one to two orders of magnitude smaller than are achieved by existing schedulers. At the same time, our scheduler still maintains fairness and has low overhead.
Charles Krasic, Mayukh Saubhasik, Anirban Sinha, Ashvin Goel
EuroSys2
2007 Evaluation of haptically augmented touchscreen gui elements under cognitive load
abstract
Adding expressive haptic feedback to mobile devices has great potential to improve their usability, particularly in multitasking situations where one's visual attention is required. Piezoelectric actuators are emerging as one suitable technology for rendering expressive haptic feedback on mobile devices. We describe the design of redundant piezoelectric haptic augmentations of touchscreen GUI buttons, progress bars, and scroll bars, and their evaluation under varying cognitive load. Our haptically augmented progress bars and scroll bars led to significantly faster task completion, and favourable subjective reactions. We further discuss resulting insights into designing useful haptic feedback for touchscreens and highlight challenges, including means of enhancing usability, types of interactions where value is maximized, difficulty in disambiguating background from foreground signals, tradeoffs in haptic strength vs. resolution, and subtleties in evaluating these types of interactions.
Rock Leung, Karon E. MacLean, Martin Bue Bertelsen, Mayukh Saubhasik
ICMI4