The Experts below are selected from a list of 15501 Experts worldwide ranked by ideXlab platform

Gruia-catalin Roman - One of the best experts on this subject based on the ideXlab platform.

  • ICSOC - Sliver: a BPEL workflow process Execution Engine for mobile devices
    Service-Oriented Computing – ICSOC 2007, 2006
    Co-Authors: Gregory Hackmann, Mart Haitjema, Christopher Gill, Gruia-catalin Roman
    Abstract:

    The Business Process Execution Language (BPEL) has become the dominant means for expressing traditional business processes as workflows. The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computational and communication resource for these workflows to exploit. However, BPEL so far has been deployed only on relatively heavyweight server platforms such as Apache Tomcat, leaving the potential created by these lower-end devices untapped. This paper presents Sliver, a BPEL workflow process Execution Engine that supports a wide variety of devices ranging from mobile phones to desktop PCs. We discuss the design decisions that allow Sliver to operate within the limited resources of a mobile phone or PDA. We also evaluate the performance of a prototype implementation of Sliver.

  • sliver a bpel workflow process Execution Engine for mobile devices
    Lecture Notes in Computer Science, 2006
    Co-Authors: Gregory Hackmann, Mart Haitjema, Christopher Gill, Gruia-catalin Roman
    Abstract:

    The Business Process Execution Language (BPEL) has become the dominant means for expressing traditional business processes as workflows. The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computational and communication resource for these workflows to exploit. However, BPEL so far has been deployed only on relatively heavyweight server platforms such as Apache Tomcat, leaving the potential created by these lower-end devices untapped. This paper presents Sliver, a BPEL workflow process Execution Engine that supports a wide variety of devices ranging from mobile phones to desktop PCs. We discuss the design decisions that allow Sliver to operate within the limited resources of a mobile phone or PDA. We also evaluate the performance of a prototype implementation of Sliver.

Gregory Hackmann - One of the best experts on this subject based on the ideXlab platform.

  • ICSOC - Sliver: a BPEL workflow process Execution Engine for mobile devices
    Service-Oriented Computing – ICSOC 2007, 2006
    Co-Authors: Gregory Hackmann, Mart Haitjema, Christopher Gill, Gruia-catalin Roman
    Abstract:

    The Business Process Execution Language (BPEL) has become the dominant means for expressing traditional business processes as workflows. The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computational and communication resource for these workflows to exploit. However, BPEL so far has been deployed only on relatively heavyweight server platforms such as Apache Tomcat, leaving the potential created by these lower-end devices untapped. This paper presents Sliver, a BPEL workflow process Execution Engine that supports a wide variety of devices ranging from mobile phones to desktop PCs. We discuss the design decisions that allow Sliver to operate within the limited resources of a mobile phone or PDA. We also evaluate the performance of a prototype implementation of Sliver.

  • sliver a bpel workflow process Execution Engine for mobile devices
    Lecture Notes in Computer Science, 2006
    Co-Authors: Gregory Hackmann, Mart Haitjema, Christopher Gill, Gruia-catalin Roman
    Abstract:

    The Business Process Execution Language (BPEL) has become the dominant means for expressing traditional business processes as workflows. The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computational and communication resource for these workflows to exploit. However, BPEL so far has been deployed only on relatively heavyweight server platforms such as Apache Tomcat, leaving the potential created by these lower-end devices untapped. This paper presents Sliver, a BPEL workflow process Execution Engine that supports a wide variety of devices ranging from mobile phones to desktop PCs. We discuss the design decisions that allow Sliver to operate within the limited resources of a mobile phone or PDA. We also evaluate the performance of a prototype implementation of Sliver.

Xuehai Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Hardware Implementation on FPGA for Task-Level Parallel Dataflow Execution Engine
    IEEE Transactions on Parallel and Distributed Systems, 2016
    Co-Authors: Chao Wang, Junneng Zhang, Aili Wang, Xi Li, Xuehai Zhou
    Abstract:

    Heterogeneous multicore platform has been widely used in various areas to achieve both power efficiency and high performance. However, it poses significant challenges to researchers to uncover more coarse-grained task level parallelization. In order to support automatic task parallel Execution, this paper proposes a FPGA implementation of a hardware out-of-order scheduler on heterogeneous multicore platform. The scheduler is capable of exploring potential inter-task dependency, leading to a significant acceleration of dependence-aware applications. With the help of renaming scheme, the task dependencies are detected automatically during Execution, and then task-level Write-After-Write (WAW) and Write-After-Read (WAR) dependencies can be eliminated dynamically. We extended the instruction level renaming techniques to perform task-level out-of-order Execution, and implemented a prototype on a state-of-art Xilinx Virtex-5 FPGA device. Given the reconfigurable characteristic of FPGA, our scheduler supports changing accelerators at runtime to improve the flexibility. Experimental results demonstrate that our scheduler is efficient at both performance and resources usage.

  • MP-Tomasulo: A Dependency-Aware Automatic Parallel Execution Engine for Sequential Programs
    ACM Transactions on Architecture and Code Optimization, 2013
    Co-Authors: Chao Wang, Junneng Zhang, Xuehai Zhou, Xiaoning Nie
    Abstract:

    This article presents MP-Tomasulo, a dependency-aware automatic parallel task Execution Engine for sequential programs. Applying the instruction-level Tomasulo algorithm to MPSoC environments, MP-Tomasulo detects and eliminates Write-After-Write (WAW) and Write-After-Read (WAR) inter-task dependencies in the dataflow Execution, therefore to operate out-of-order task Execution on heterogeneous units. We implemented the prototype system within a single FPGA. Experimental results on EEMBC applications demonstrate that MP-Tomasulo can execute the tasks out-of-order to achieve as high as 93.6p to 97.6p of ideal peak speedup. A comparative study against a state-of-the-art dataflow Execution scheme is illustrated with a classic JPEG application. The promising results show MP-Tomasulo enables programmers to uncover more task-level parallelism on heterogeneous systems, as well as to ease the burden of programmers.

Sameh Elnikety - One of the best experts on this subject based on the ideXlab platform.

  • hybrid query Execution Engine for large attributed graphs
    Information Systems, 2014
    Co-Authors: Sherif Sakr, Sameh Elnikety
    Abstract:

    Graphs are widely used for modeling complicated data such as social networks, bibliographical networks and knowledge bases. The growing sizes of graph databases motivate the crucial need for developing powerful and scalable graph-based query Engines. We propose a SPARQL-like language, G-SPARQL, for querying attributed graphs. The language enables the expression of different types of graph queries that are of large interest in the databases that are modeled as large graph such as pattern matching, reachability and shortest path queries. Each query can combine both structural predicates and value-based predicates (on the attributes of the graph nodes/edges). We describe an algebraic compilation mechanism for our proposed query language which is extended from the relational algebra and based on the basic construct of building SPARQL queries, the Triple Pattern. We describe an efficient hybrid Memory/Disk representation of large attributed graphs where only the topology of the graph is maintained in memory while the data of the graph are stored in a relational database. The Execution Engine of our proposed query language splits parts of the query plan to be pushed inside the relational database (using SQL) while the Execution of other parts of the query plan is processed using memory-based algorithms, as necessary. Experimental results on real and synthetic datasets demonstrate the efficiency and the scalability of our approach and show that our approach outperforms native graph databases by several factors.

  • horton online query Execution Engine for large distributed graphs
    International Conference on Data Engineering, 2012
    Co-Authors: Mohamed Sarwat, Sameh Elnikety, Gabriel Kliot
    Abstract:

    Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query Execution Engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query Execution Engine with a query optimizer that allows interactive Execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

  • ICDE - Horton: Online Query Execution Engine for Large Distributed Graphs
    2012 IEEE 28th International Conference on Data Engineering, 2012
    Co-Authors: Mohamed Sarwat, Sameh Elnikety, Gabriel Kliot
    Abstract:

    Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query Execution Engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query Execution Engine with a query optimizer that allows interactive Execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

Gabriel Kliot - One of the best experts on this subject based on the ideXlab platform.

  • horton online query Execution Engine for large distributed graphs
    International Conference on Data Engineering, 2012
    Co-Authors: Mohamed Sarwat, Sameh Elnikety, Gabriel Kliot
    Abstract:

    Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query Execution Engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query Execution Engine with a query optimizer that allows interactive Execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.

  • ICDE - Horton: Online Query Execution Engine for Large Distributed Graphs
    2012 IEEE 28th International Conference on Data Engineering, 2012
    Co-Authors: Mohamed Sarwat, Sameh Elnikety, Gabriel Kliot
    Abstract:

    Graphs are used in many large-scale applications, such as social networking. The management of these graphs poses new challenges as such graphs are too large for a single server to manage efficiently. Current distributed techniques such as map-reduce and Pregel are not well-suited to processing interactive ad-hoc queries against large graphs. In this paper we demonstrate Horton, a distributed interactive query Execution Engine for large graphs. Horton defines a query language that allows the expression of regular language reach ability queries and provides a query Execution Engine with a query optimizer that allows interactive Execution of queries on large distributed graphs in parallel. In the demo, we show the functionality of Horton managing a large graph for a social networking application called Codebook, whose graph represents data on software components, developers, development artifacts such as bug reports, and their interactions in large software projects.