Transactional memory (TM) is receiving attention as a way of expressing parallelism for programming multi-core systems. As a parallel programming model it is able to avoid the complexity of conventional locking. TM ca...
详细信息
Transactional memory (TM) is receiving attention as a way of expressing parallelism for programming multi-core systems. As a parallel programming model it is able to avoid the complexity of conventional locking. TM can enable multi-core hardware that dispenses with conventional bus-based cache coherence, resulting in simpler and more extensible systems. this is increasingly important as we move into the many-core era. Within TM, however, the processes of conflict detection and committing still require synchronization and the broadcast of data. By increasing the granularity of when synchronization is required, the demands on communication are reduced. Software implementations of TM have taken advantage of the fact that the object structure of data can be employed to further raise the level at which interference is observed. the contribution of this paper is the first hardware TM approach where the object structure is recognized and harnessed. this leads to novel commit and conflict detection mechanisms, and also to an elegant solution to the virtualization of version management, without the need for additional software TM support. A first implementation of the proposed hardware TM system is simulated. the initial evaluation is conducted withthree benchmarks derived from the STAMP suite and a transactional version of Lee's routing algorithm.
OWL and RDF/RDFS are ontological languages developed by the World Wide Web Consortium (W3C), which have become a de facto standard for the ontological descriptions in various domains. the evolution of these standards ...
详细信息
OWL and RDF/RDFS are ontological languages developed by the World Wide Web Consortium (W3C), which have become a de facto standard for the ontological descriptions in various domains. the evolution of these standards was influenced by the numerous advances in the research of knowledge representation and reasoning. Although support for reasoning and standardized representation is the key benefit of these technologies, there is a lack of existing test frameworks, which would be capable of addressing many crucial aspects of the Semantic Web applications. In this paper we propose a methodology for automated testing of OWL reasoners based on the real-world ontologies. this specification covers both terminological and assertional reasoning as well as checking of the correctness of the answers. An opensource implementation of such framework is described and a study of initial results is provided. the tests cover an extensive set of reasoners and ontologies and provide a state-of-the-art insight into the field of OWL reasoning.
In the "Grid" vision, demanding applications are dynamically assigned to supercomputers whose resources in terms of available CPU power and storage capacity ("grid resources") allow them to process...
详细信息
ISBN:
(纸本)9781424426256
In the "Grid" vision, demanding applications are dynamically assigned to supercomputers whose resources in terms of available CPU power and storage capacity ("grid resources") allow them to process the given jobs. However, distributedapplications may also be demanding in terms of the minimum bandwidth and maximum end-to-end delay ("network resources") available for the communication between its instances. this has lead to the development of several Network Resource Provisioning Systems (NRPSs), each offering certain possibilities to reserve bandwidth between network endpoints in a single administrative domain. To offer a greater variety of services to users and to facilitate cooperation among users of different domains, it seems natural to establish dedicated inter-domain links to extend the possibilities given by NRPSs to multiple domains. Unfortunately, it is not viable to place several domains under the control of any single NRPS to allow for inter-domain bandwidth reservations, since these systems generally require full network topology knowledge and administrative rights in each domain. Furthermore, each system was developed with a specific focus and therefore best fulfils the requirements of the users within certain domains. When considering possible approaches to enable multi-domain bandwidth reservations, it is important to have in mind the separation between "resource management", which lies within the autonomy of each domain and whose details are hidden to the outside, and the interoperability between the domains. this extended abstract will describe the design decisions taken to solve the exposed problems within the Phosphorus project.
this paper applies a formalization of the use of UML to the VPN service management system. An approach that supports a use case-driven, step-wised and incremental development in building models for the VPN service man...
详细信息
ISBN:
(纸本)9780769530499
this paper applies a formalization of the use of UML to the VPN service management system. An approach that supports a use case-driven, step-wised and incremental development in building models for the VPN service management system is studied in detail. the actual process of building the models shows the importance and feasibility of the formalization itself
Formal specification are indispensable for computer-aided verification and testing of communication protocols. However, a large number of the practical protocols have only informal specifications, mostly in English. T...
详细信息
ISBN:
(纸本)9780769530499
Formal specification are indispensable for computer-aided verification and testing of communication protocols. However, a large number of the practical protocols have only informal specifications, mostly in English. there are no general procedures to derive formal specifications from such informal specification. In this paper we model Session Initiation Protocol (SIP) by parameterized extended finite state machines. We also provide insights gained in the derivation of the formal specification.
this paper first defines a format for capturing and distributing contributed resources called an eContract and then proposes an agreement protocol along with a simple distributed algorithm for negotiating the eContrac...
ISBN:
(纸本)9780769530499
this paper first defines a format for capturing and distributing contributed resources called an eContract and then proposes an agreement protocol along with a simple distributed algorithm for negotiating the eContract in the context of dynamic collaborations. the insights gained from the analysis of the proposed negotiation algorithm lead us to the development of an efficient "message piggybacking" negotiation algorithm.
the paper presents IARnet toolkit, a set of high-level tools and services simplifying integration of software resources into a distributedcomputing environment and development of distributedapplications involving dy...
详细信息
ISBN:
(纸本)9783540739395
the paper presents IARnet toolkit, a set of high-level tools and services simplifying integration of software resources into a distributedcomputing environment and development of distributedapplications involving dynamic discovery and composition of resources. A case study of using IARnet for solving large scale discrete optimization problems is discussed.
distributed virtual environments tend to become a de facto solution for large-scale networked virtual environments. One of the key issues and problems that need to be handled in the design of a scalable and effective ...
详细信息
ISBN:
(纸本)9780769530499
distributed virtual environments tend to become a de facto solution for large-scale networked virtual environments. One of the key issues and problems that need to be handled in the design of a scalable and effective distributed virtual environment system is the partitioning problem, which refers to the efficient assignment of the system's workload to the available resources of the system. this paper presents an object driven partitioning approach based on the partitioning algorithm of Lui & Chan, who proposed a three step technique for balancing the workload among the servers of the distributed Virtual Environment.
In this paper we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longe...
详细信息
ISBN:
(纸本)9780769530499
In this paper we give a parallel algorithm for the longest increasing subsequence problem on a LARPBS, one of the recently proposed parallel model based on optical bus. For a sequence of n integers, we solve the longest increasing subsequence problem in O(k) time using n processors where k is the length of the solution. then, we give an algorithm for the maximal layers problem that runs in O(k+log(n)) time for a set of n points where k is the number of layers on a n-processor array. To our knowledge, this is the fastest algorithm for that problem.
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which suppo...
详细信息
ISBN:
(纸本)9780769530499
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which supports lazy evaluation and automatic parallelisation. the execution engine abstracts away details of parallelism and distribution, and uses JIT compilation to produce efficient code. this work is part of a broader project to provide a programming environment for developing distributedapplications which hides low-level details from the application developer the language we have designed plays the role of an intermediate form into which existing functional languages can be transformed. the runtime system demonstrates how distributed execution can be implemented directly within a virtual machine, instead of a separate piece of middleware that coordinates the execution of external programs.
暂无评论