Learn More
Mobile computing devices intended for disconnected operation, such as laptops and personal organizers , must employ optimistic replication strategies for user les. Unlike traditional distributed systems, such devices do not attempt to present a \single lesystem" semantics: users are aware that their lesys-tems are replicated, and that updates to one replica(More)
Web-business platforms offer business capabilities as enterprise services hosted in a multi-tenant cloud environment. Often there is a need to create heavyweight variants of these enterprise services to support: inherent variability in the underlying business process, industry-specific requirements, globalization concerns and customer-specific requirements.(More)
As Service-Oriented Computing is gaining mainstream adoption, Services are emerging as core-building blocks of today's applications. In particular, web services have become the most common technology manifestation of the service-oriented computing paradigm. Basic open-standards that enable web services such as WSDL, SOAP etc. have evolved and stabilized(More)
In this paper, we propose an algorithm, DOPTICS, a parallelized version of a popular density based cluster-ordering algorithm OPTICS. Parallelizing OPTICS is challenging because of its strong sequential data access behavior. To achieve high parallelism, a data parallel approach that exploits the underlying indexing structure is proposed. We implement the(More)
A Service represents an underlying capability offered by a service provider. A service description describes two facets of a service – the service functionality (capability on-offer) and the terms at which the service is offered (terms of offer). The capability on-offer satisfies the goal of a service consumer under the constraints of the terms of offer.(More)
Real time scheduling algorithms like RM and EDF have been analyzed extensively in the literature. Many recent works on scheduling address energy consumption as a performance metric. In this work we analyze priority scheduling algorithms RM, EDF, and LLF along with a few power-aware scheduling algorithms: MLLF, RM_RCS and EDF_RCS. Our analysis addresses the(More)
In a services marketplace where a service is provided by multiple service providers, service offerings have to be differentiated against competitor services. Differentiation helps to sustain as well as grow market share. Strategies to differentiate service offerings have to be unintrusive - without requiring major changes to the existing service realization(More)
In a services marketplace where a particular service is provided by multiple service providers, service offerings have to be differentiated against competitor services in order to gain market share. Differentiation of services is also needed for different markets and for different consumer segments. Strategies to differentiate service offerings have to be(More)
In systems with power constraints, context switches in a task schedule result in wasted power consumption. We present variants of priority scheduling algorithms – Rate Monotonic and Earliest Deadline First-that reduce the number of context switches in a schedule. We prove that our variants output feasible schedules whenever the original algorithms do. We(More)
A fast loss recovery scheme for IP multicast services is presented in this paper. In this scheme, the head field of retransmission request packets contains the one-way delay between the requestor and the sender of the lost packet, and the head field of repair packets contains the one-way delay between the repairer and the requestor. Each member in the(More)