The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Within service-oriented architectures, components need to discover and interact with suitable services, which in turn can be mapped to particular subtasks. Similarly, in online social communities users may wish to discover information related to a particular interest that matches their personal preferences. These tasks are difficult when the number of available resources to select from is large, and...
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of bargaining agents to induce a socially optimal allocation. The literature contains many proposals for calculating a social welfare but the Nash welfare seems to be the one which has the most interesting properties for a fair...
Distributed load managers exhibit thrashing where tasks are repeatedly moved between locations due to incomplete global load information. This paper shows that systems of Autonomous Mobile Programs (AMPs) exhibit the same behaviour, identifying two types of redundant movement and terming them greedy effects. AMPs are unusual in that, in place of some external load management system, each AMP periodically...
Auctions are well-studied mechanisms to solve decentralized resource allocation problems. In situations where complementarity exists among resources, combinatorial auctions may be utilized. Unfortunately, combinatorial auctions often incur hefty computational requirements, in that the underlying winner determination problem is known to be NP-hard. Although a number of efficient implementations are...
A natural requirement of a resource allocation system is to guarantee fairness to its participants. Fair allocation can be achieved either by distributed protocols known as cake-cutting algorithms or by centralized approaches, which first collect the agents' preferences and then decide on the allocation. Compared with cake-cutting algorithms, centralized approaches ageless restricted and can therefore...
The traffic load of wireless local area networks (WLANs) is often distributed unevenly among access points. In addition, interference from collocated wireless devices operating in the same unlicensed frequency band may cause WLANs to become unstable, leading to temporary failures of access points. This paper addresses the questions of how to dynamically balance the load and how to quickly respond...
An infrastructure-as-a-service cloud system provides computational capacities to remote users. Parallel processing in the cloud system can shorten the execution of jobs. Parallel processing requires a mechanism to scheduling the executions order as well as resource allocation. Furthermore, a preemptable scheduling mechanism can improve the utilization of resources in clouds. In this paper, we present...
Efficient metadata management is critical for distributed file system in cloud computing. In this paper we propose a new metadata management scheme which employs master metadata server (MMDS) and metadata look-up table server between the metadata servers and clients. The MMDS checks the state of MDSs for load-balancing, and thereby avoids hot spot. The proposed scheme significantly reduces the network...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.