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

Vijayanand Sankarasubramanian

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

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

Systems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
Distributed and cloud data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
mapreduce
0.112011
Nova: continuous Pig/Hadoop workflows · SIGMOD Conference 2011
Parallel and multicore computing › parallel programming models
dataflow programming
0.012011
Nova: continuous Pig/Hadoop workflows · SIGMOD Conference 2011
YearPublicationVenuePosition
2011 Nova: continuous Pig/Hadoop workflows
abstract
This paper describes a workflow manager developed and deployed at Yahoo called Nova, which pushes continually-arriving data through graphs of Pig programs executing on Hadoop clusters. (Pig is a structured dataflow language and runtime for the Hadoop map-reduce system.)
Christopher Olston, Greg Chiou, Laukik Chitnis, Francis Liu, Yiping Han, Mattias Larsson, Andreas Neumann 0001, Vellanki B. N. Rao, Vijayanand Sankarasubramanian, Siddharth Seth, Topher ZiCornell
SIGMOD Conference9
1996 Multiway Partitioner for High Performance FPGA Based Board Architecture
abstract
Field-programmable gate array based board architectures are becoming fairly common for rapid prototyping and custom computing. In order to map large designs on multiple FPGA based boards, the design has to be partitioned into two or more segments. In this paper we describe the architecture, constraints, and a solution to the area and pin constrained partitioning problem. Our effort is directed towards partitioning "huge" designs in relatively small amount of time, thus giving the designer a capability to explore many mapping solutions. The board level architecture is based on multi-chip modules, where each MCM consists of three Xilinz 4025 FPGAs and a dual ported one mega byte SRAM. In its smallest configuration the board can map 300,000 gate size designs.
Vijayanand Sankarasubramanian, Dinesh Bhatia
ICCD1