In order to support processing of highly concurrent transactions at low price on distributed database server systems, Network Of Workstations (NOW) is wed as the hardware environment. In order to share resources that ...
详细信息
ISBN:
(纸本)0769511538
In order to support processing of highly concurrent transactions at low price on distributed database server systems, Network Of Workstations (NOW) is wed as the hardware environment. In order to share resources that are distributed among different sites of NOW and support the database functionalities, Persistent distributed Shared Virtual Memory (PDSVM) is implemented on ShusseUo, an object database system developed by Kyushu University, Japan. In ShusseUo, all workstations cooperate to perform jobs submitted by database applications. Each job consists of several transactions. these transactions are executed on PDSVM and the cost of each transaction varies according to the workstation on which the transaction nlns. In the present paper we present the Cost-based Transaction Coordinator(CTC) algorithm. In CTC, the load information of a transaction is collected automatically while the transaction is running, and it is feedbacked when the transaction is committed In CTC, each transaction is coordinated to a certain workstation based on its cost as calculated wing the feedbacked information and the distribution information of the database. the algorithm is evaluated in terms of the TPC-C benchmark. the benchmark result is presented and analyzed in the present paper.
New methods of electronic collaboration are needed: to manage and reconcile the vast scientific knowledge made ar available through the experience of diverse experts. Fundamental research in capturing, managing, analy...
详细信息
ISBN:
(纸本)0769511538
New methods of electronic collaboration are needed: to manage and reconcile the vast scientific knowledge made ar available through the experience of diverse experts. Fundamental research in capturing, managing, analyzing, and explaining information and making it available for use is seen as a high priority for software research worldwide. therefore, we have developed a method and software for intelligent-agent assisted knowledge fusion systems to address these needs. this system utilizes intelligent agents to facilitate the construction and fusion of knowledge from distributed human experts working on a common knowledge sharing task. In this paper;we describe our multi-agent system prototype, the Internet-based distributed Ophthalmology Consensus System (I-DOCS) and how,ve are employing it for finding disease genes. We also describe some results of using I-DOGS with clinicians attempting to develop a common clinical nomenclature and classification system for disease subtypes.
this is a report on a panel titled "What are the top ten most influential parallel and distributedprocessing concepts of the last millennium'?" that was held at the ieee Computer Society sponsored "...
this is a report on a panel titled "What are the top ten most influential parallel and distributedprocessing concepts of the last millennium'?" that was held at the ieee Computer Society sponsored "14th International parallel and distributedprocessingsymposium (IPDPS 2000)." the panelists were chosen to represent a variety of perspectives and technical areas. After the panelists had presented their choices for the top ten, an open discussion was held among the audience and panelists. At the end of the discussion, a ballot was distributed for the audience to vote on the top ten concepts (in arbitrary order). the voting identified the following ten most influential parallel and distributedprocessing concepts of the last millennium: (1) Amdahl's law and scalability, (2) Arpanet and Internet, (3) pipelining, (4) divide and conquer approach, (5) multiprogramming. (6) synchronization (including semaphores), (7) load balancing, (8) message passing and packet switching, (9) cluster computing, and (10) multithreaded (lightweight) program execution. (C) 2001 Academic Press.
We present a VLSI architecture and implementation for a highly parallel trellis-based stereo matching algorithm that has been previously presented by the authors. the algorithm obtains disparity (depth) information fr...
详细信息
Distribution is often discussed under different issues of interest in the context of workflow management. this paper contributes a general framework for this discussion, i.e. it presents a general framework for workfl...
详细信息
ISBN:
(纸本)0769511538
Distribution is often discussed under different issues of interest in the context of workflow management. this paper contributes a general framework for this discussion, i.e. it presents a general framework for workflow management in distributed environments. Technical and organizational issues are analyzed that have an impact on the design of a distributed workflow management system. Within the core part of this paper we present a taxonomy enabling to compare implementation concepts of different workflow management systems especially with respect to distribution.
In this paper we present two generic parallel skeletons for Tabu Search method -a well known meta-heuristic for approximately solving combinatorial optimization problems.. the first skeleton is based on independent ru...
详细信息
ISBN:
(纸本)0769511538
In this paper we present two generic parallel skeletons for Tabu Search method -a well known meta-heuristic for approximately solving combinatorial optimization problems.. the first skeleton is based on independent runs while the second in the classical master-slave model. Our starting point is the design and implementation of a sequential skeleton that is used later as basis for the two parallel skeletons. Both skeletons provide the riser,viththe followings: (a) permit to obtain parallel implementations of Tabu Search method for concrete combinatorial optimization problems from existing sequential implementations: (b) there is no need for the user to know neither parallel programming nor communication libraries;(c) the parallel implementation of Tabu Search for a concrete problem is obtained automatically from a sequential implementation of Tabu Search for the problem. the skeletons, however require from the user a sequential instantiation of Tabu Search method for the problem at hand. the skeletons are implemented in C++ using MPI as communication library and offer genericity, flexibility, component reuse, robustness and time savings. We have instantiated the two skeletons for the 0-1 Multidimensional Knapsack problem, among others, for which we report computational results.
Ar the beginning of the new millennium we continue to witness in the modern information technology industry two fundamental trends: ongoing Internet revolution and global consolidation. IT departments of all kinds hav...
详细信息
ISBN:
(纸本)0769511538
Ar the beginning of the new millennium we continue to witness in the modern information technology industry two fundamental trends: ongoing Internet revolution and global consolidation. IT departments of all kinds have their resources free to deal with consequences these phenomena. Integration of data and services is rapidly becoming their number one task. Information stored in different types of providers distributedthroughout the enterprise network must be integrated, and used to build new kinds of e-commerce applications, information portals, and other types of applications leveraging the power of distributed computing. We recognized these trends and developed Jasmine ii, a new information management infrastructure to build, deploy, and manage such distributed applications capable of bringing together data from distributed and heterogeneous sources of information. the infrastructure is designed to be scalable and transparent with regards to concurrency, replication, access, and location. In this paper we describe how we achieve such design objective by illustrating the key components of the infrastructure: object cache manager event manager, and transaction manager. We also Explain some novel features of each component.
Recently, parallel computing is popularly applied to many systems. Functional programming is suitable for parallel programming because of referential transparency and is applied to symbol processing systems and parall...
详细信息
ISBN:
(纸本)0769514146
Recently, parallel computing is popularly applied to many systems. Functional programming is suitable for parallel programming because of referential transparency and is applied to symbol processing systems and parallel database systems. Programs of some functional programming can be regarded as graph and are processed in terms of reduction of the corresponding graph. this paper proposes fault tolerance of functional programming based on graph reduction. the proposed method stores the received graph as a message log and the erroneous task is recovered by using the checkpoint and the stored graph. the computer simulations say that time overhead of the proposed method is small. If checkpoint interval is 30 seconds and the number of tasks is 3, for example, time overhead is less than 10%.
In this paper, we present a new mobility-support model for applications, Application Module Request Broker (AMRB). We focus on two types of mobility: host mobility and application code mobility. these two types of mob...
详细信息
ISBN:
(纸本)0769511538
In this paper, we present a new mobility-support model for applications, Application Module Request Broker (AMRB). We focus on two types of mobility: host mobility and application code mobility. these two types of mobility dynamically change the binding between applications' name and location in the network. AMRB conceals these changes of binding to reduce a complexity in development of applications. In AMRB, we deal with mobile application codes that communicate with each other as Application Modules (AMs). AMRB provides AM's service transparent communication for applications by using a specifier which does not need to include any network location information. Furthermore, applications can use AM's service transparently of migration by exploiting location management mechanism. In this paper, we describe the design and implementation of AMRB and some evaluations. Also, we demonstrate a sample application that AMRB is effective for developing mobile sensor type applications.
this paper describes the design of a model as well as an architecture to provide support for distributed advances workflow transactions. We discuss the application of transaction concepts to activities that involve in...
详细信息
ISBN:
(纸本)0769511538
this paper describes the design of a model as well as an architecture to provide support for distributed advances workflow transactions. We discuss the application of transaction concepts to activities that involve integrated execution of multiple tasks over different processes. this kind of applications are described as transactional workflows the classical commit protocol, used in many commercial systems is nor suitable for use in multilevel secure distributed workflow database systems that use a locking prorocol for concurrency control. the reason is that, it is not possible for a locking protocol to guarantee that read locks be not released by a subtransaction during its window of uncertainty - period after a participant has voted yes to commit, but before it receives the commit or abort decision from the coordinator possibly resulting in nonserializable executions A distinguishing feature of the proposed workflow transaction support system is the ability to manage the arbitrary distribution of business processes over multiple workflow management systems.
暂无评论