Demo Data from EDBT 2026 / reviewers in the wild / expert
Apoorv Srivastava
dblp:94/4342
· DBLP profile ↗
5ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-7008-6618ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 2 first-authorArtificial intelligence and machine learning · 1Computer networks · 1 · 1 since 2021
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
2 papers |
Memory systems · 65% Processor architecture and microarchitecture · 28% Hardware accelerators and domain-specific architectures · 6% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory bandwidth |
0.0 | 1 | 1999 | Mapping Irregular Applications to DIVA, a PIM-based Data-Intensive Architecture · SC 1999 |
Memory systems
processing-in-memory |
0.0 | 1 | 1999 | Mapping Irregular Applications to DIVA, a PIM-based Data-Intensive Architecture · SC 1999 |
Memory systems › memory interface
processor-memory interface |
0.0 | 1 | 1999 | Mapping Irregular Applications to DIVA, a PIM-based Data-Intensive Architecture · SC 1999 |
Processor architecture and microarchitecture › branch handling
branch architecture |
0.0 | 1 | 1993 | Prophetic branches: a branch architecture for code compaction and efficient execution · MICRO 1993 |
Processor architecture and microarchitecture
branch prediction |
0.0 | 1 | 1993 | Prophetic branches: a branch architecture for code compaction and efficient execution · MICRO 1993 |
Processor architecture and microarchitecture › pipelining
instruction pipeline |
0.0 | 1 | 1993 | Prophetic branches: a branch architecture for code compaction and efficient execution · MICRO 1993 |
Hardware accelerators and domain-specific architectures
irregular application acceleration |
0.0 | 1 | 1999 | Mapping Irregular Applications to DIVA, a PIM-based Data-Intensive Architecture · SC 1999 |
Compilers and program optimization › code size reduction
code compaction |
0.0 | 1 | 1993 | Prophetic branches: a branch architecture for code compaction and efficient execution · MICRO 1993 |
Methods — techniques the papers use, named apart from their topics
parcel-based communication · 0.0PIM-to-PIM interconnect · 0.0modeling · 0.0comparison · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Application Aware Multiple Constraint Optimal Paths for Transport Network Using SDNabstractThe backhaul networks for the 5G networks consist of different links that handle massive heterogeneous traffic. Fulfilling the QoS requirement of users to comply with the growth and increasing revenue is a challenge for the service providers. We address QoS parameters like bandwidth and delay for the user’s transport network. We use Software-Defined Networking and solve this problem. We have added a component Flowlet based Multiple Constraint Optimal Paths (MCOP) for packet forwarding by taking input as QoS requirements and creating a logical network in backhaul transport networks when needed for the elephant traffic. Due to security reasons, the transport network cannot access L7 to identify the application type. We have added an application identification component to detect the traffic type. We use an experimental platform using mininet and OpenFlow. Our proposed algorithm has higher QoS performance than the conventional method after the primary link exhaust capacity. It takes around 20 to 30 packets to learn the traffic type up to L6 parameters. Our approach identifies 73.10% of traffic type. The multipath usage helps improve revenue growth by assuring the dynamic allocation of the resources to the customer for elephant flow with the required QoS. Santhosh Kamath, Apoorv Srivastava, Prathamesh Kamath, Sanjay Singh 0002, M. Sathish Kumar |
IEEE Trans. Netw. Serv. Manag. | 2 |
| 2020 | Solving energy management of renewable integrated microgrid systems using crow search algorithm
Bishwajit Dey, Biplab Bhattacharyya, Apoorv Srivastava |
Soft Comput. | 3 |
| 1999 | Mapping Irregular Applications to DIVA, a PIM-based Data-Intensive ArchitectureabstractProcessing-in-memory (PIM) chips that integrate processor logic into memory devices offer a new opportunity for bridging the growing gap between processor and memory speeds, especially for applications with high memory-bandwidth requirements.The Data-IntensiVe Architecture (DIVA) system combines PIM memories with one or more external host processors and a PIM-to-PIM interconnect.DIVA increases memory bandwidth through two mechanisms: (1) performing selected computation in memory, reducing the quantity of data transferred across the processor-memory interface; and (2) providing communication mechanisms called parcels for moving both data and computation throughout memory, further bypassing the processor-memory bus.DIVA uniquely supports acceleration of important irregular applications, including sparse-matrix and pointer-based computations.In this paper, we focus on several aspects of DIVA designed to effectively support such computations at very high performance levels: (1) the memory model and parcel definitions; (2) the PIM-to-PIM interconnect; and, (3) requirements for the processor-to-memory interface.We demonstrate the potential of PIMbased architectures in accelerating the performance of three irregular computations, sparse conjugate gradient, a natural-join database operation and an object-oriented database query. Mary W. Hall, Peter M. Kogge, Jefferey G. Koller, Pedro C. Diniz, Jacqueline Chame, Jeffrey T. Draper, Jeff LaCoss, John J. Granacki, Jay B. Brockman, Apoorv Srivastava, William C. Athas, Vincent W. Freeh, Joonseok Park |
SC | 10 |
| 1995 | 190-MHz CMOS 4-Kbyte Pipelined CachesabstractIn this paper we describe the design and implementation of a 190-MHz pipelined 4-Kbyte instruction and data cache. The caches are designed in 1.0-µm CMOS and measure 0.78 x 0.47 cm 2 . This paper describes the microarchitecture, cache timing, circuit implementation, and layout of both the instruction and the data cache. The key features of these caches are pipelined execution and the use of dynamic single-phase clock logic. We discuss the interface of this cache with the processor core and the off-chip controller. This paper also describes the pipelined structure of the cache and the miss detection and handling logic. Published in ISCAS `95, Seattle 1 ABSTRACT In this paper we describe the design and implementation of a 190-MHz pipelined 4-Kbyte instruction and data cache. The caches are designed in 1.0-µm CMOS and measure 0.78 x 0.47 cm 2 . This paper describes the microarchitecture, cache timing, circuit implementation, and layout of both the instruction and the data cache. T... Apoorv Srivastava, Yong-Seon Koh, Barton Sano, Alvin M. Despain |
ISCAS | 1 |
| 1993 | Prophetic branches: a branch architecture for code compaction and efficient executionabstractClocked (synchronous) and self-timed (asynchronous) methodologies represent the two principal design approaches associated with timing control and synchronization of digital systems. In the paper, clocked and asynchronous instruction pipelines are modeled and compared. The approach which yields the best performance is dependent on technology parameters, operating range and pipeline algorithm characteristics. Design curves are presented which permit selection of the best approach for a given application and technology environment.> Apoorv Srivastava, Alvin M. Despain |
MICRO | 1 |