Binary Decision Diagrams (BDDs) provide very efficient representations of Boolean functions and have been widely used in various computer-aided design of VLSI systems. As the construction time of BDDs varies with appl...
详细信息
ISBN:
(纸本)0780354729
Binary Decision Diagrams (BDDs) provide very efficient representations of Boolean functions and have been widely used in various computer-aided design of VLSI systems. As the construction time of BDDs varies with applications and is often large in some complex circuits, it would be useful to design parallel algorithms to construct BDDs. In this paper, we propose two parallel algorithms for constructing the BDDs of logic circuits. We first present a shared memory parallel algorithm using locks. To achieve more parallelism, we present another algorithm using replication of fanin cones that is suitable for execution on distributed memory multicomputers. Experimental results showing speedups for some ISCAS benchmark circuits are reported on an 8 processor IBM J-40 shared memory multiprocessor, an 8 processor SGI Origin 2000 distributed shared memory multiprocessor, and a 16 processor IBM SP-2 distributed memory multicomputer.
An environmental information system with a distributed database is proposed. In this system, concerned groups manage the servers offering environmental product information relevant to their activities. All of the serv...
详细信息
An environmental information system with a distributed database is proposed. In this system, concerned groups manage the servers offering environmental product information relevant to their activities. All of the servers are connected in a network. The collection of the distributed environmental product information is automated by a searching software program. An inverse manufacturing environmental product information system and an LCA system called FusionNet LCA are developed as examples of environment information systems with a distributed database. The development of these systems demonstrates that it is in fact possible to develop an environmental information system with a distributed database.
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. first, in any massively parallel system, some processors are bound t...
详细信息
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. first, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock-free routing algorithm for the hypercube. The algorithm tolerates a large number of faults in a worst-case configuration.
Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data values. Query processing for these applicat...
详细信息
Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data values. Query processing for these applications require different views of data for decision support. The Data Cube operator provides multi-dimensional aggregates, used to calculate and store summary information on a number of dimensions. The multi-dimensionality of the underlying problem can be represented both in relational and multi-dimensional databases, the latter being a better fit when query performance is the criteria for judgment. Relational databases are scalable in size and efforts are on to make their performance acceptable. On the other hand multi-dimensional databases perform well for such queries, although they are nor very scalable. parallel computing is necessary to address the scalability and performance issues for these data sets. In this paper we present a parallel and scalable infrastructure for OLAP and multidimensional analysis. We use chunking to store data either as a dense block using multidimensional arrays (md-arrays) or a sparse set using a Bit encoded sparse structure (BESS). Chunks provide a multidimensional index structure for efficient dimension oriented data accesses much the same as md-arrays do. Operations within chunks and between chunks are a combination of relational and multi-dimensional operations depending on whether the chunk is sparse or dense. We present performance results for data sets with 3, 5 and 10 dimensions for our implementation on the IBM SP-2 which show good speedup and scalability.
We present practical experiences gathered from the employment of two popular Java-based mobile-agent platforms, IBM's Aglets and Mitsubishi's Concordia. We present some basic distributed computing models and d...
详细信息
We present practical experiences gathered from the employment of two popular Java-based mobile-agent platforms, IBM's Aglets and Mitsubishi's Concordia. We present some basic distributed computing models and describe their adaptation to the mobile-agent paradigm. Upon these models we develop a set of frameworks for distributed database access over the World Wide Web, using IBM's Aglets and Mitsubishi's Concordia platforms. We compare the two platforms both quantitatively and qualitatively. For the quantitative comparison, we propose, employ, and validate an approach to evaluate and analyse mobile-agent framework performance. For the qualitative assessment, we present our observations about the programmability and robustness of, and mobility provided by, the two platforms.
Full support of parallelism in object-relational database systems (ORDBMSs) is desired. The parallelization techniques developed for relational database systems are not adequate for ORDBMS because of the introduction ...
详细信息
Full support of parallelism in object-relational database systems (ORDBMSs) is desired. The parallelization techniques developed for relational database systems are not adequate for ORDBMS because of the introduction of complex abstract data types and operations on ordered domains. In this paper, we consider a data stream paradigm and develop a query parallelization framework that exploits characteristics of user-defined functions in a ORDBMS during query optimization. By introducing the concept of windows and abstract data type orderings, we develop a novel approach for parallelizing user-defined functions in a distributed ORDBMS environment. The implementation issues in providing query services in ordered domains are also discussed.
Storing multidimensional data in databases is an important topic both in the industrial and scientific database communities. Arrays are offered as a multidimensional data structure by most programming languages. Conve...
详细信息
Storing multidimensional data in databases is an important topic both in the industrial and scientific database communities. Arrays are offered as a multidimensional data structure by most programming languages. Conventional database systems, however, do not support arrays of arbitrary dimensionality and base type. RasDaMan is a DBMS integrating arrays as a first class data type offering both a declarative query language and a specialised storage structure for arrays. The work presented here evaluates the performance of queries on multidimensional array data stored in RasDaMan versus storage in a conventional RDMS. In the relational system, the data is both mapped to relations and stored directly as binary data in BLOBs. The queries executed were modelled after queries common in scientific applications and decision support.
The Delaunay system supports an interactive, customizable interface for querying multimedia distributeddatabases, like Digital Libraries. Through this interface, users select virtual document styles that cater the di...
详细信息
The Delaunay system supports an interactive, customizable interface for querying multimedia distributeddatabases, like Digital Libraries. Through this interface, users select virtual document styles that cater the display of query results to their needs, while also offering transparent pre- and post-query refinement and nested querying. Delaunay's virtual documents preserve context by maintaining a single customizable interface for result viewing. The advanced transparent query features rely on mediation to provide adept access to information. In this paper, we present the framework for Delaunay, its architecture, the user interface, and results of the first usability study.
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping and task-ordering step in the multi-step...
详细信息
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping and task-ordering step in the multi-step class of scheduling algorithms. Unlike current multistep approaches, LLB integrates cluster-mapping and task-ordering in a single step. The benefits of this integration are twofold. first, it allows dynamic load balancing in time, because only the ready tasks are considered in the mapping process. Second, communication is also considered, as opposed to algorithms like WCM and GLB. The algorithm has a low time complexity of O(E+V(log V+log P)), where E is the number of dependences, V is the number of tasks and P is the number of processors. Experimental results show that LLB outperforms known cluster-mapping algorithms of comparable complexity, improving the schedule lengths up to 42%. Furthermore, compared with LCA, a much higher-complexity algorithm, LLB obtains comparable results for fine-grain graphs and yields improvements up to 16% for coarse-grain graphs.
Interval temporal logic (ITL) is a real-time logic for specifying and verifying real-time systems. In this paper, ITL is used to specify a concurrent real-time system: an assembly line which is an abstract model of in...
详细信息
Interval temporal logic (ITL) is a real-time logic for specifying and verifying real-time systems. In this paper, ITL is used to specify a concurrent real-time system: an assembly line which is an abstract model of industrial robot control systems. We can specify the abstract properties of the system in ITL as well as the system design using the executable subset of ITL, Tempura. Compared with other approaches, the first advantage of this methodology is that the concurrent real-time systems can be naturally specified in a true concurrent model rather than an interleaving model. The second is that the specification of the system design is executable so that the simulation can be obtained in the same formal framework. Therefore, both the properties of the system and the consistency of the specification can be checked before verification.
暂无评论