Learn More
There is growing interest in large-scale resource sharing with emerging architectures such as cloud computing, where globally distributed and commodi-tized resources can be shared and traded. Federated clouds, a topic of recent interest , aims to integrate different types of cloud resources from different providers, to increase scalability and reliability.(More)
Current distributed computing infrastructures, such as peer-to-peer networks, grids, and more recently clouds, make sharing and trading resources ubiquitous. In these large distributed systems, rational users are both providers and consumers of resources. Currently, there is growing interest in exploiting economic models for the allocation of shared(More)
Wireless sensor networks have emerged as an exciting technology for a wide range of important applications that acquire and process information from the physical world. Grid computing has evolved as a standards-based approach for coordinated resource sharing. Sensor grids combine these two promising technologies by extending the grid computing paradigm to(More)
Simulation components are semantically composable if the newly composed model is meaningful in terms of expressed behaviors, and achieves the desired objective. The validation of semantic composability is challenging because reused simulation components are heterogeneous in nature and validation must consider various aspects including logical, temporal, and(More)
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the new composed model. Validation of semantic composability is a non-trivial problem because reused simulation components are heterogeneous in nature and validation must consider(More)
There is growing interest to replace traditional servers with low-power multicore systems such as ARM Cortex-A9. However, such systems are typically provisioned for mobile applications that have lower memory and I/O requirements than server application. Thus, the impact and extent of the imbalance between application and system resources in exploiting(More)
The time lower bounds for both uniform consensus and early stopping consensus have already been proved in synchronous distributed systems with crash failures, but both have not been proved with orderly crash failures and remain as open problems. This paper uses a bivalency argument proof to solve the two open problems. The first open problem is how to prove(More)