Aditya Dube
Microsoft
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Aditya Dube.
IEEE Transactions on Software Engineering | 2000
Vikram S. Adve; Rajive L. Bagrodia; James C. Browne; Ewa Deelman; Aditya Dube; Elias N. Houstis; John R. Rice; Rizos Sakellariou; David Sundaram-Stukel; Patricia J. Teller; Mary K. Vernon
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runtime and operating system software, and hardware architecture. Toward this end, the POEMS framework supports composition of component models from these different domains into an end-to-end system model. This composition can be specified using a generalized graph model of a parallel system, together with interface specifications that carry information about component behaviors and evaluation methods. The POEMS Specification Language compiler will generate an end-to-end system model automatically from such a specification. The components of the target system may be modeled using different modeling paradigms and at various levels of detail. Therefore, evaluation of a POEMS end-to-end system model may require a variety of evaluation tools including specialized equation solvers, queuing network solvers, and discrete event simulators. A single application representation based on static and dynamic task graphs serves as a common workload representation for all these modeling approaches. Sophisticated parallelizing compiler techniques allow this representation to be generated automatically for a given parallel program. POEMS includes a library of predefined analytical and simulation component models of the different domains and a knowledge base that describes performance properties of widely used algorithms. The paper provides an overview of the POEMS methodology and illustrates several of its key components. The modeling capabilities are demonstrated by predicting the performance of alternative configurations of Sweep3D, a benchmark for evaluating wavefront application technologies and high-performance, parallel architectures.
workshop on software and performance | 1998
Ewa Deelman; Aditya Dube; Adolfy Hoisie; Yong Luo; Richard L. Oliver; David Sundaram-Stukel; Harvey Wasserman; Vikram S. Adve; Rajive L. Bagrodia; James C. Browne; Elias N. Houstis; Olaf M. Lubeck; John R. Rice; Patricia J. Teller; Mary K. Vernon
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runtime and operating system software, and hardware architecture. Toward this end, the POEMS framework supports composition of component models from these different domains into an end-to-end system model. This composition can be specified using a generalized graph model of a parallel system, together with interface specifications that carry information about component behaviors and evaluation methods. The POEMS Specification Language compiler, under development, will generate an end-to-end system model automatically from such a specification. The components of the target system may be modeled using different modeling paradigms (analysis, simulation, or direct measurement) and may be modeled at various levels of detail. As a result, evaluation of a POEMS end-to-end system model may require a variety of evaluation tools including specialized equation solvers, queuing network solvers, and discrete-event simulators. A single application representation based on static and dynamic task graphs serves as a common workload representation for all these modeling approaches. Sophisticated parallelizing compiler techniques allow this representation to be generated automatically for a given parallel program. POEMS includes a library of predefined analytical and simulation component models of the different domains and a knowledge base that describes performance properties of widely used algorithms. This paper provides an overview of the POEMS methodology and illustrates several of its key components. The methodology and modeling capabilities are demonstrated by predicting the performance of alternative configurations of Sweep3D, a complex benchmark for evaluating wavefront application technologies and high-performance, parallel architectures. Index Terms—Performance modeling, parallel system, message passing, analytical modeling, parallel simulation, processor simulation, task graph, parallelizing compiler, compositional modeling, recommender system.
ieee international conference on high performance computing data and analytics | 2000
James C. Browne; Emery D. Berger; Aditya Dube
Performance models are software systems in which the components implement abstractions of the behavior of a total system. This paper describes a capability for semiautomatic development of performance models of computer systems spanning applications, operating systems, and hardware by composition from a library of components. Compositional development of performance models is a domain-specific instance of the general problem of software component reuse or design reuse. The concepts enabling compositional development of performance models in POEMS are encapsulation of analysis-level objects with associative interfaces and hierarchical dynamic data flow graphs as a structuring model. Objects with associative interfaces will be called compositional objects. Compositional objects and hierarchical dynamic data flow graphs provide a framework for the development of performance models that incorporate multiple modes of evaluation, span multiple semantic domains, span multiple levels of abstraction, and parallel implementation. Algorithms for composition through associative interfaces with automatic generation of parallel executables for the performance models will be defined.
Archive | 2004
Ashish Khisti; Aditya Dube
Archive | 2005
Avnish Kumar Chhabra; Vikrant H. Desai; Aditya Dube; Madhurima Pawar
Archive | 2005
Joseph M. Joy; Aditya Dube
Archive | 2000
Joseph M. Joy; Arvind Murching; Aditya Dube; Alireza Dabagh
Archive | 2005
Aditya Dube; Fengfen Liu; Alireza Dabagh
Archive | 2005
Avnish Kumar Chhabra; Aditya Dube; Sanjay N. Kaniyar; James T. Pinkerton
Archive | 2001
Alireza Dabagh; Aditya Dube; Arvind Murching; Fengfen Liu