Results 1 -
8 of
8
Supporting self-adaptation in streaming data mining applications
- In Proceedings of IEEE International Parallel & Distributed Processing Symposium(IPDPS
, 2006
"... There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time or interactive response, which are more crucial. This paper presents and evaluates a runtime algorithm for supporting adap ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
(Show Context)
There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time or interactive response, which are more crucial. This paper presents and evaluates a runtime algorithm for supporting adaptive execution for such applications. The particular domain we target is distributed data mining on streaming data. This work has been done in the context of a middleware system called GATES (Grid-based AdapTive Execution on Streams) that we have been developing. The self-adaptation algorithm we present and evaluate in this paper has the following characteristics. First, it carefully evaluates the long-term load at each processing stage. It consider different possibilities for the load at a processing stage and its next stages, and decides if the value of an adaptation parameter needs to be modified, and if so, in which direction. To find the ideal new value of an adaptation parameter, it performs a binary search on the specified range of the parameter. To evaluate the self-adaptation algorithm in our middleware, we have implemented two streaming data mining applications. The main observations from our experiments are as follows. First, our algorithm is able to quickly converge to stable values of the adaptation parameter, for different data arrival rates, and independent of the specified initial value. Second, in a dynamic environment, the algorithm is able to adapt the processing rapidly. Finally, in both static and dynamic environments, the algorithm clearly outperforms the algorithm described in our earlier work and an obvious alternative, which is based on linear-updates. 1.
Language and compiler support for adaptive applications, in
- SC’04: Proceedings of the 2004 ACM/IEEE Conference on Supercomputing, IEEE Computer Society
, 2004
"... There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such as the need for real-time response or limit on the consumption of certain resources, which are more crucial. This paper prov ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such as the need for real-time response or limit on the consumption of certain resources, which are more crucial. This paper provides a combined language/compiler and runtime solution for supporting adaptive execution of these applications, i.e., to allow them to achieve the best precision while still meeting the specified constraint at runtime. The key idea in our language extensions is to have the programmers specify adaptation parameters, i.e, the parameters whose values can be varied within a certain range. A program analysis algorithm states the execution time of an application component as a function of the values of the adaptation parameters and other runtime constants. These constants are determined by initial runs of the application in the target environment. We integrate this work with our previous work on supporting coarse-grained pipelined parallelism, and thus support adaptive execution for data-intensive applications in a distributed environment. Our experimental results on three applications have shown that our combined compile-time/runtime model can predict the execution times quite well, and therefore, support adaptation to meet a variety of constraints. 1.
AFPAC: ENFORCING CONSISTENCY DURING THE ADAPTATION OF A PARALLEL COMPONENT
, 2010
"... component ..."
(Show Context)
12345678901234567890123456789012123456789012345678901234567890121234567890123456789012
"... 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 123456789012345678901234567890121234567 ..."
Abstract
- Add to MetaCart
(Show Context)
12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012 12345678901234567890123456789012123456789012345678901234567890121234567890123456789012
Enforcing Consistency During the Adaptation of a
- In The 4th Int.l Symposium on Parallel and Distributed Computing
, 2005
"... As Grid architectures provide execution environments that are distributed, parallel and dynamic, applications require to be not only parallel and distributed, but also able to adapt themselves to their execution environment. This article presents a model for designing self-adaptable parallel compone ..."
Abstract
- Add to MetaCart
As Grid architectures provide execution environments that are distributed, parallel and dynamic, applications require to be not only parallel and distributed, but also able to adapt themselves to their execution environment. This article presents a model for designing self-adaptable parallel components that can be assembled to build applications for Grid. This model includes the definition of a consistency criterion for the dynamic adaptation of SPMD components. We propose a solution to implement this criterion. It has been evalued on both synthetic and real codes to exhibit the behavior of the several proposed strategies.
Approved by Adviser
"... Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. Moreover, many of these applications involve high volume data streams and require real-time and distributed processing of data arising from a distributed set of sources. We belie ..."
Abstract
- Add to MetaCart
(Show Context)
Increasingly, a number of applications rely on, or can potentially benefit from, analysis and monitoring of data streams. Moreover, many of these applications involve high volume data streams and require real-time and distributed processing of data arising from a distributed set of sources. We believe that a grid environment is well suited for flexible and adaptive analysis of these streams. Thus, our research focuses on designing and evaluating a middleware to support the processing of these streams. Our system is referred to as GATES (Grid-based AdapTive Execution on Streams). It flexibly achieves the best accuracy that is possible while maintaining the real-time constraint on the analysis. We have developed self-adaptation algorithms for this purpose. Further, we have addressed the problem of resource allocation in the GATES system. We design a static resource allocation algorithm to generate sub-optimal allocations and the experimental evaluation shows these allocations are very close to the optimal one. We also develop an infrastructure to support resource monitoring
OPTIMISING TRANSPARENCY, PERFORMANCE AND RELIABILITY IN THE MOBILITY SUBSYSTEM OF A MOBILE OBJECT FRAMEWORK
, 2004
"... This thesis describes a number of advances made in order to produce a mobile object framework that is better suited for use in ad hoc networks than its predecessors. The focus of this thesis is on improving the performance, transparency and reliability of the mobility subsystem, which is responsible ..."
Abstract
- Add to MetaCart
(Show Context)
This thesis describes a number of advances made in order to produce a mobile object framework that is better suited for use in ad hoc networks than its predecessors. The focus of this thesis is on improving the performance, transparency and reliability of the mobility subsystem, which is responsible for the migration of objects from one device to another. Based on a comprehensive review of the literature, a new mobility subsystem has been proposed and implemented. The resulting runtime environment and proxy structure provides increased performance, and by managing erroneous situations within the proxies and supporting architecture, the reliability and transparency have been increased to both developers and end users. A series of empirical tests are executed against the new mobility subsystem, demonstrating the advantages of its reference management strategies and its fitness for use in ad hoc networks of
EXPERIENCE FEEDBACK FROM DYNACO
, 1782
"... Performance and practicability of dynamic adaptation for parallel computing: an experience feedback from ..."
Abstract
- Add to MetaCart
(Show Context)
Performance and practicability of dynamic adaptation for parallel computing: an experience feedback from
