Abstract: Service Composition has been a challenging research area for many years. One of the key ideas in this area is the matchmaking (at the semantic level) of requested services and the portfolio of services registered in a given service repository. Accordingly, a composite service can be generated by selecting a set of existing service components that partially match the requested service, and composing these services. In this paper we introduce a general framework for the Service Composition process and our efforts to automate this process. This framework exploits the semantic annotation of services and their parameters. The main annotations we focus on are service inputs, outputs, goals, preconditions, effects, and non-functional properties. Matchmaking aims at making sure that the selected service components are capable of interacting with each other, while the composition aims at orchestrating these selected service components to fulfil the

User defined services in file systems: A case study and prototype implementation

The fundamental premise behind the DASH project is that it is fea-sible to build large-scale shared-memory multiprocessors with hardware cache coherence. While paper studies and software sirn-ulators are useful for understanding many high-level design trade-offs, prototypes are essential to ensure

In this report we describe the current progress with respect to prototype implementations of algebraic kernels within the ACS project. More specifically, we report on: (1) the CGAL package Algebraic kernel for circles 2 2 aimed at providing the necessary algebraic functionality required

An Archival Intermemory solves the problem of highly survivable digital data storage in the spirit of the Internet. In this paper we describe a prototype implementation of Intermemory, including an overall system architecture and implementations of key system components. The result is a working

-level, simulation-oriented languages also enable optimizations to be performed that are difficult and cumbersome at the lower-level of traditional parallel simulators; a good example of this is granularity control. This paper describes a prototype implementation of APOSTLE -- a new high-level, simulation

ABSTRACT- Kqueue event notification API is implemented for Linux in the form of a loadable kernel module. Existing BSD applications that use kqueue API were ported to Linux and approved the correct implementation functionality. Event requests are preserved in the kernel and thus improvement

Abstract not found

realtime behaviour is required [1]. To verify this statement, two prototypes were built (representing the two most popular categories of operating systems) and stack-based intrusion detection mechanisms have been integrated into the network stack. 1

. Simple virtual address bit manipulation can be used to access the same virtual address in a different process ’ address space. This paper describes a prototype implementation of MPI that uses SMARTMAP for intra-node message passing. SMARTMAP has several advantages over POSIX shared memory techniques