Yazar "Erdil, D.C." seçeneğine göre listele
Listeleniyor 1 - 3 / 3
Sayfa Başına Sonuç
Sıralama seçenekleri
Öğe Dependable autonomic cloud computing with information proxies(2011) Erdil, D.C.Autonomic computing systems promise to manage themselves on a set of basic rules specified to higher level objectives. One of the challenges in making this possible is dependable collaboration among peers in a large-scale network. Effective maintenance of next generation distributed systems, such as clouds and second generation grids, will be nearly impossible without autonomic computing, with ever increasing scale of such systems. In addition, due to the nature of autonomous clouds to form administrative boundaries, dependable collaboration becomes a much harder problem. Employing information proxies may help improve such collaboration in existence of administrative boundaries. Although a general proxy definition can refer to many contexts, we focus on such proxies for dependable collaboration for distributed resource scheduling. Our definition of information proxies, and the particular areas we make use of them mainly contribute to the self-configuring and self-optimizing fundamentals of the autonomic computing paradigm in general. By simulation, we show that information proxies help improve resource scheduling decisions that support large-scale autonomic computing systems. Key Words: self-provisioning, self-configuring, self-optimizing, information proxies, dependable cloud computing, autonomic network computing. © 2011 IEEE.Öğe Proxy-based cloud resource sharing(2011) Erdil, D.C.Recent advances in information technology make remote collaboration and resource sharing easier for next generation distributed systems, such as grids and clouds. One common model of study is the convergence of these systems, along with interclouds to a unified global computing resource. Despite similarities between grids and clouds, there are a number of fundamental differences that make this convergence process harder. For example, they negatively affect the possibility of a seamless intercloud federation on the path to convergence. Resource sharing in general and related communication methodologies, such as information dissemination, matchmaking, and so on, are also integral elements in this convergence process. This article proposes information proxies (i.e., proxies that disseminate information on behalf of a resource, or a collection of resources) to help make available resource state at 'distant' clouds where there is no direct control. © 2011 IEEE.Öğe Social ranking criteria for pairwise gossiping in large-scale resource scheduling(2011) Erdil, D.C.The concept of online presence has long been available only to people with enough technical background to complete a set of tasks with gory details. Thus, actual utilization of large-scale networks, such as grids and clouds, has not been realized until recently. With the advances in technology in multiple areas, such as multi-core CPUs, low-power energy-efficient FPGAs, virtualization, service-oriented architectures and web services, and autonomic computing, there has been an area of opportunity for the not-so-technologically advanced masses to actually take part in large-scale computing. Social networks are important to large-scale networking because they close one of the fundamental gaps: the trust between autonomous entities, which usually do not have a relationship history, or a ranking mechanism. One other common problem in large-scale networking is resource matchmaking, finding the right set of resource providers for a set of requesters, and vice versa. Traditional approaches to resource matchmaking use centralized repositories, which at the minimum does not scale well, among other issues. In this study, we propose adaptive pairwise gossiping protocols to take feedback from the system, based on existing basic social relationships, and trust levels between autonomous entities in the network. In addition to the ranking criteria we previously employed while selecting which nodes to gossip to, such as execution history, average distance, freshness of information, we also propose employing several social ranking criteria: overall popularity, trusted execution history, and social distance. By simulation, we show that (i) these social ranking criteria can be mapped to traditional ranking criteria in large-scale resource matchmaking, and (ii) the social ranking criteria perform comparably, based on several performance metrics. Moreover, we have a prototype social networking application that can incorporate such ranking criteria. We are still in the implementation phase, in which we are working on particular methodologies to measure and compare the performances of the two similar sets of ranking criteria in two different domains. © 2011 IEEE.
