Accurate modeling of coupling effects via the substrate is an increasingly important concern in the design of mixedsignal systems such as communication, biomedical and analog signal processing circuits. Fast-switching...
详细信息
ISBN:
(纸本)1581139470
Accurate modeling of coupling effects via the substrate is an increasingly important concern in the design of mixedsignal systems such as communication, biomedical and analog signal processing circuits. Fast-switching digital blocks inject noise into the common substrate hindering the performance of high-precision sensible analog circuitry. Miniaturization effects on ICs complexity inevitably make the accuracy requirements for substrate coupling simulation increase. Due in part to the global nature of such couplings, model extraction and analysis is a computation-intensive task requiring the availability of fast and accurate substrate model extraction and analysis tools. One way to deal with this problem is to take further advantage of available computational technologies and distributed computing emerges as an interesting solution. In this paper we discuss several issues related to the parallelization of a Multigrid-based substrate model extraction and analysis tool. This tool is used as a proxy for generic computations on a 3D discretized volume. The results presented indicate potential avenues for successfully exploiting parallelism as well as pitfalls to avoid in such a quest.
In this paper we describe a Grid-enabled system for monitoring HLA-based applications to enable load balancing by migration of federates. The monitoring is based on the OCM-G system [2]. We show how the design concept...
详细信息
ISBN:
(纸本)0769522327
In this paper we describe a Grid-enabled system for monitoring HLA-based applications to enable load balancing by migration of federates. The monitoring is based on the OCM-G system [2]. We show how the design concepts of the OCM-G enable easy adaptation to monitoring of HLA, C++-based applications. The solution presented in this paper is transparent to the user application and does not require any changes to the original HLA RTI code. We also describe the role of monitoring the whole system for managing execution of HLA-based applications described in [25]. We discuss implementation issues and present test results for the monitoring overhead.
In recent years, we have witnessed the success of autonomous agents applying machine learning techniques across a wide range of applications. However, agents applying the same machine learning techniques in online app...
详细信息
In recent years, we have witnessed the success of autonomous agents applying machine learning techniques across a wide range of applications. However, agents applying the same machine learning techniques in online applications have not been so successful. Even agent-based hybrid recommender systems that combine information filtering techniques with collaborative filtering techniques have only been applied with considerable success to simple consumer goods such as movies, books, clothing and food. Complex, adaptive autonomous agent systems that can handle complex goods such as real estate, vacation plans, insurance, mutual funds, and mortgage have yet emerged. To a large extent, the reinforcement learning methods developed to aid agents in learning have been more successfully deployed in offline applications. The inherent limitations in these methods have rendered them somewhat ineffective in online applications. In this paper, we postulate that a small amount of prior knowledge and human-provided input can dramatically speed up online learning. We will demonstrate that our agent HumanE - with its prior knowledge or "experiences" about the real estate domain -can effectively assist users in identifying requirements, especially unstated ones, quickly and unobtrusively.
Most XML-Enabled database management systems can only translate a few relations into an XML document. Moreover, the translation is without data semantics constraints consideration, which may not be sufficient for info...
详细信息
ISBN:
(纸本)0769521088
Most XML-Enabled database management systems can only translate a few relations into an XML document. Moreover, the translation is without data semantics constraints consideration, which may not be sufficient for information highway on the web. The demand on database is increased in e-commerce. Not only relational database (RDB) is needed for traditional data processing, but also its equivalent XML documents (database) are needed for B2B applications. Therefore, performance for online conversion from relational data to XML document is an issue. This paper aims to create a replicate XML database for a company's RDB to improve database performance, and to automate XML database recovery in case of system failures. For any successful update to the RDB, corresponding update will be applied to its replicate XML database. The result is an incrementally maintained XML database for efficient and effective computing for e-commerce. In summary, Internet computing performance can be improved because a replicate XML database and its counterpart RDB can be parallel processing for both internal data and external data transmission on the Internet. Furthermore, an XML database can be recovered by its counterpart RDB once it is down.
This paper proposes an algorithm for multiple cracks reconstruction from ECT signals by means of a simulated annealing parallelized on a supercomputer. The algorithm takes not only the profiles of cracks but also the ...
详细信息
This paper proposes an algorithm for multiple cracks reconstruction from ECT signals by means of a simulated annealing parallelized on a supercomputer. The algorithm takes not only the profiles of cracks but also the number of cracks as unknown, which is a very important feature from the practical point of view. A fast forward code using a database is upgraded for the rapid computation of the ECT signals of a differential mutual induction probe due to multiple cracks. The algorithm is applied to the reconstruction of the multiple cracks of a JSAEM round-robin test geometry. The reconstruction result using a simulated signal proves the validity of the proposed approach.
To satisfy the stringent QoS requirements of distributed real-time embedded (DRE) systems, middleware services customized to the specific needs of the application may be needed. This problem is often attacked by re-im...
详细信息
ISBN:
(纸本)0769521487
To satisfy the stringent QoS requirements of distributed real-time embedded (DRE) systems, middleware services customized to the specific needs of the application may be needed. This problem is often attacked by re-implementing all or large portions of an existing middleware service, which can be a time-consuming and an error prone task. In this paper, we propose a model-driven approach for middleware customization. To enable this approach, we propose Event Communication Framework (ECF), a customizable middleware framework which provides a number of different options for implementing various features of event communication. To determine when to exercise each option, we have performed experiments to identify the application contexts in which each ECF mechanism performs better than the others. Heuristics from these experiments have been incorporated into algorithms which analyze high-level specifications of application scenarios to identify where ECF customizations can be applied. We provide configuration tools that generate customized push paths for event notifications using a combination of code synthesis, weaving and transformation techniques. We have applied our approach to the application scenarios in the Boeing BoldStroke system.
We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to th...
详细信息
We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the correspondingly restricted problem of assigning n jobs to m parallel machines. In a pure Nash equilibrium, no user may improve its own individual cost (delay) by unilaterally switching to another link from its set of allowed links. As our main result, we introduce a polynomial time algorithm to compute from any given assignment a pure Nash equilibrium with non-increased makospan. The algorithm gradually changes a given assignment by pushing unsplittable user traffics through a network that is defined by the users and the links. Here, we use ideas from blocking flows. Furthermore, we use similar techniques as in the generic PREFLOW-PUSH algorithm to approximate a schedule with minimum makespan, gaining an improved approximation factor of 2 - 1/w1 for identical links, where w1 is the largest user traffic. We extend this result to related links, gaining an approximation factor of 2. Our approximation algorithms run in polynomial time. We close with tight upper bounds on the coordination ratio for pure Nash equilibria.
In pre-Gridservice times, conventional way of pooling domain expertise is by sharing legacy codes. With the introduction and wide adoption of OGSA framework and OGSI specification, Grid computing has entered a new era...
详细信息
ISBN:
(纸本)3540235647
In pre-Gridservice times, conventional way of pooling domain expertise is by sharing legacy codes. With the introduction and wide adoption of OGSA framework and OGSI specification, Grid computing has entered a new era of service-orientation, in which implementation of sharing domain expertise resorts to portable, interoperable Grid services. So comes the challenge to gridify existing scientific computing legacy codes (to convert to OGSI-compliant Grid services). This paper analyzes features of scientific legacy codes and proposes a design scheme of gridificaiton. The design scheme consists of three parts: gridified computing services;scientific computing Operation Providers(OPs);"on-demand" scientific computing factories. The design solution has been successfully applied to Bioinformatics field. Application scope tests show that the design solution applies to most types of scientific computing legacy codes. Performance experiments find that the proposed gridification mechanisms bring about only slight efficiency loss.
暂无评论