Since its introduction over a decade ago the tuple space paradigm has attracted interest from the distributed systems community. Despite being developed for shared memory parallel architectures, the simplicity and ele...
详细信息
ISBN:
(纸本)9781450373173
Since its introduction over a decade ago the tuple space paradigm has attracted interest from the distributed systems community. Despite being developed for shared memory parallel architectures, the simplicity and elegance of the model has led researchers to attempt to realise it in loosely coupled distributed environments. this paper argues that these attempts have largely failed due to their selection of inappropriate target domains, lack of multicast support and failure to operate in heterogeneous environments. We present the design and implementation of a new tuple space platform engineered using IP multicast. the platform is designed to support complex distributed applications such as groupware and mobile applications, operates over a range of end-systems and networks and offers performance comparable to existing RPC based platforms even in tests designed to benefit the RPC paradigm.
the proceedings contain 122 papers. the topics discussed include: the CMS TIER1 at JINR: five years of operations;CRIC: the information system for LHC distributed computing;the atlas event index and its evolution base...
the proceedings contain 122 papers. the topics discussed include: the CMS TIER1 at JINR: five years of operations;CRIC: the information system for LHC distributed computing;the atlas event index and its evolution based on apache kudu storage;big data as the future of information technology;the designing of cloud infrastructure consisting of geographically distributed data centers;multicomponent cluster management system for the computing center at IHEP;RUNNET: infrastructural and service basis of the national research and education network of the Russian Federation;virtual testbed as a case for big data;and properties of the parallel discrete event simulation algorithms on small-world communication networks.
this article describes and compares two parallel implementations of Branch-and-Bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the spe...
详细信息
ISBN:
(纸本)076951880X
this article describes and compares two parallel implementations of Branch-and-Bound skeletons. Using the C++ programming language, the user has to specify the type of the problem, the type of the solution and the specific characteristics of the Branch-and-Bound technique. this information is combined withthe provided resolution skeletons to obtain a distributed and a shared parallel programs. MPI has been used to develop the Message Passing algorithm and for the Shared Memory one OpenMP has been chosen. Computational results for the 0/1 Knapsack Problem on a Sunfire 6800 SMP, a Origin 3000 and a PCs cluster are presented.
this paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key pr...
详细信息
ISBN:
(纸本)9781565550278
this paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key problems must be addressed by such a system. First the timing characteristics of the parallel simulator must be sufficiently predictable to allow one to guarantee that real-time deadlines for completing simulation computations will be met. Second, the optimistic computation must be able to interact with its surrounding environment with as little latency as possible, necessitating rapid commitment of I/O *** address the first question, we show that optimistic simulators that never send incorrect messages (sometimes called “aggressive-no-risk” simulators) provide sufficient predictability to allow traditional schedulability analysis techniques commonly used in real-time systems to be applied. We show that incremental state saving techniques introduce sufficient unpredictability that they are not well-suited for real-time environments. We observe that the traditional “lowest timestamp first” scheduling policy used in many optimistic parallelsimulation systems is an optimal (in the real-time sense) scheduling algorithm when event timestamps and real-time deadlines are the same. Finally, to address the question for rapid commitment of I/O operations, we utilize a continuous GVT computation scheme for shared-memory multiprocessors where a new value of GVT is computed after processing each event in the *** ideas are incorporated in a parallel, optimistic, real-time simulation system called PORTS. Initial performance measurements of the shared-memory based PORTS system executing on a Kendall Square Research multiprocessor are presented. Initial performance results are encouraging, demonstrating that PORTS achieves performance approaching that of a conventional Time Warp system for the benchmark programs that were tested.
In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by ...
详细信息
ISBN:
(纸本)076950728X
In some scenarios involving on-line transaction processing within a distributed database, it is desirable to synchronize transactions in a manner that guarantees conflict equivalence with a serial schedule ordered by original transaction start times while providing each transaction with an anomaly serializable isolation. Few theoretical concurrency control algorithms guarantee such a conflict equivalence, and we are unaware of any protocol that accomplishes this while supporting real-world issues such as out-of-order transaction messages, out-of-order operation executions, and out-of-order transaction committals without the burden of explicit readset and writeset declarations We describe an algorithm that provides this guarantee mid supports these issues while requiring only table-level writeset declarations.
As is well known Lamport's Bakery algorithm for mutual exclusion of n processes is correct if a physically shared memory is used as the communication facility between processes. An application of weaker consistenc...
详细信息
We present ViMPIOS, a novel MPI-IO implementation based on ViPIOS, the Vienna parallel Input Output System. ViMPIOS inherits the defining characteristics of ViPIOS, which makes it a client-server based system focusing...
详细信息
the Grid provides a new and unrivaled technology for large scale distributedsimulation as it enables collaboration and the use of distributed computing resources. this panel paper presents the views of four researche...
详细信息
ISBN:
(纸本)0769522327
the Grid provides a new and unrivaled technology for large scale distributedsimulation as it enables collaboration and the use of distributed computing resources. this panel paper presents the views of four researchers in the area of distributedsimulation and the Grid. Together we try to identify the main research issues involved in applying Grid technology to distributedsimulation and the key future challenges that need to be solved to achieve this goal. Such challenges include not only technical challenges, but also political ones such as management methodology for the Grid and the development of standards. the benefits of the Grid to end-user simulation modelers also are discussed.
the Generic Runtime Infrastructure for distributedsimulation (GRIDS) has been developed to investigate modularity issues in distributedsimulation. It could be argued that although the HLA RTI is a widespread solutio...
详细信息
ISBN:
(纸本)0769518532
the Generic Runtime Infrastructure for distributedsimulation (GRIDS) has been developed to investigate modularity issues in distributedsimulation. It could be argued that although the HLA RTI is a widespread solution to distributedsimulation, it cannot include all possible services. this paper investigates an approach to extending the distributedsimulation services available in the HLA RTI. One example of this is bridging support for HLA/DIS legacy integration. this paper therefore presents GRIDS, how GRIDS can be used to provide modular service support for the HLA RTI, and a case study on legacy integration to demonstrate our approach.
the proceedings contain 9 papers. the topics discussed include: supporting peer-2-peer interactions in the consumer grid;DPS - dynamic parallel schedules;ParoC++: a requirement-driven parallel object-oriented programm...
ISBN:
(纸本)076951880X
the proceedings contain 9 papers. the topics discussed include: supporting peer-2-peer interactions in the consumer grid;DPS - dynamic parallel schedules;ParoC++: a requirement-driven parallel object-oriented programming language;on the implementation of JavaSymphony;compiler and runtime support for running OpenMP programs on Pentium- and Itanium-architectures;SMP-aware message passing programming;a comparison between MPI and OpenMP branch-and-bound skeletons;a comparison between MPI and OpenMP branch-and-bound skeletons;and algorithmic concept recognition support for skeleton based parallel programming.
暂无评论