Learn More
In this paper we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous mul-tiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable(More)
In this paper we extend Liu & Layland's utilization bound for fixed priority scheduling on uniprocessors to homogeneous multiprocessor systems under a partitioning strategy. Assuming that tasks are pre-emptively scheduled on each processor according to fixed priorities assigned by the Rate-Monotonic policy, and allocated to processors by the First Fit(More)
Nowadays, enterprises providing services through Internet often require online services supplied by other enterprises. This entails the cooperation of enterprise servers using Web services technology. The service exchange between enterprises must be carried out with a determined level of quality, which is usually established in a service level agreement(More)
Web services are becoming an essential technology for the development of current distributed applications. Therefore, the organizations must be aware of the possibilities and limitations of the web services and their enabling technologies related to interoperability, performance, security, etc. Benchmarking techniques can provide very useful insights about(More)
Today, scalable servers are key elements of most information systems. Their operational requirements, like good response time, low power consumption or high availability, are more and more strict. To fulfill these requirements continuously a proper management policy must be used. But the complexity of these servers prevents the application of manual(More)