In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent ...
详细信息
Dixon Resultant method can eliminate many variables simultaneously. It is often used to solve a system of polynomial equations. However, the Dixon matrix is often singular, and the Dixon Resultant vanishes identically...
详细信息
Identifying protein coding genes is one of most challenging problems in computational molecular biology. With increasing numbers of sequenced eukaryotic genomes and syntenic maps across species, it is possible to appl...
详细信息
A semi-dynamic system is presented that is capable of predicting the performance of parallel programs at runtime. The functionality given by the system allows for efficient handling of portability and irregularity of ...
详细信息
A semi-dynamic system is presented that is capable of predicting the performance of parallel programs at runtime. The functionality given by the system allows for efficient handling of portability and irregularity of parallel programs. Two forms of parallelism are addressed: loop level parallelism and task level parallelism.
Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules...
详细信息
Following the knowledge provided by the theory of programming, we present an abstract syntax of the membrane systems, and their semantics. We define an appropriate notion of configurations, and sets of inference rules corresponding to the three stages of an evolution step in membrane systems. A notion of bisimulation is defined; bisimulation relations allow to compare the evolution behaviour of two membrane systems. On the other hand, the practice of programming related to membrane systems is given by the presentation of some sequential and parallel software simulators, emphasizing their specific features.
In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent ...
详细信息
In this study, we have successfully developed a grid-enabled software distributed shared memory called Teamster-G. This system provides users with not only a shared memory programming interface but also a transparent resource allocation service to easily develop applications and aggregate distributed resources for solving their problems on the grid environment. Moreover, since the communication cost of maintaining data-consistency is a big problem for the performance of the DSM applications, Teamster-G exploits a cluster cache scheme and a two-level consistency protocol to minimize the number of data-consistency messages transferred over wide area network. We will present the framework and the performance of Teamster-G in this paper.
A graph partitioning-based heuristic load-balancing algorithm known as the largest-task-first-with-minimum-finish-time-and-available-communication-costs from EVAH package by M.J. Djomehri, et. al. (2003) is modified i...
详细信息
A graph partitioning-based heuristic load-balancing algorithm known as the largest-task-first-with-minimum-finish-time-and-available-communication-costs from EVAH package by M.J. Djomehri, et. al. (2003) is modified in order to be dynamically adapted to heterogeneous computing environments like a grid. An example is given to show the improvement.
Reference counting is the memory management technique of most widespread use today. This paper presents a new multi-processor architecture for parallel cyclic reference counting. In this architecture, there is no dire...
详细信息
Reference counting is the memory management technique of most widespread use today. This paper presents a new multi-processor architecture for parallel cyclic reference counting. In this architecture, there is no direct mutator-collector communication and synchronization is kept minimal.
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such a view is a time consuming problem, po...
详细信息
An important requirement for the effective scheduling of parallel applications on large heterogeneous clusters is a current view of system resource availability. Maintaining such a view is a time consuming problem, potentially O(N/sup 2/). Although CPU availability is relatively easy to monitor, interconnecting network bandwidth varies not only with network topology, but also with message size and even with respect to the load of the communicating nodes. This paper describes a method for predicting a cluster's network performance for the purpose of scheduling parallel applications. The method generates a cluster-specific network model which can predict the latency of communications between any pair of nodes in linear time and under any computational and/or communication load conditions. The paper also presents the models generated for the Centurion cluster at the University of Virginia and the Orange Grove cluster at Syracuse University. A study of the prediction accuracy of the method under various load conditions by comparison to experimental measurements indicates an average prediction error of approximately 5% with the maximum encountered prediction error of less than 9%.
Sequential consistency is an intuitive consistency model that simplifies reasoning about concurrent multiprocessor programs. Most implementations of high-performance multiprocessors, however, utilize mechanisms that a...
详细信息
Sequential consistency is an intuitive consistency model that simplifies reasoning about concurrent multiprocessor programs. Most implementations of high-performance multiprocessors, however, utilize mechanisms that al low instructions to execute out of order resulting in consistency models that are weaker than sequential consistency and further complicating the job of programmers. This paper invests all possible combinations of re-ordering of read and write instructions and their effects on the correctness of programs that are designed for sequential consistency. It shows that with certain combinations of re-orderings, any program that accesses shared memory through only reads and writes and that is correct assuming sequential consistency, can be transformed to a new program that does not use any explicit synchronization, and that remains correct in spite of the instruction re-ordering. With other combinations of re-ordering, such transformations do not exist, and even solutions to the mutual exclusion problem are impossible without resorting to explicit synchronization.
暂无评论