RESERV: A Distributed, Load Balanced Information System for Grid Applications
|
|
- Alfred Butler
- 8 years ago
- Views:
Transcription
1 RESERV: A Distributed, Load Balanced Information System for Grid Applications Gábor Vincze, Zoltán Novák, Zoltán Pap, Rolland Vida Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics {vincze, novak, pap, vida}@tmit.bme.hu Abstract Resource information systems are a key component of Computational Grids. Centralized information systems hamper scalability and reliability, and thus, completely distributed resource information systems, based on Distributed Hash Tables have been proposed. In some cases resource distribution might be highly uneven, load balancing of data becomes thus a crucial problem. However, current load balancing schemes cannot handle large amounts of data corresponding to a single resource type. In this paper we propose therefore RESERV, a distributed information system for Grid applications with a novel load balancing approach, able to handle extreme load unbalance. 1. Introduction Computational Grids provide means to organize globally distributed resources into a virtual supercomputer, supplying thus the computing power to solve grand challenge problems such as financial modelling, earthquake simulation or global climate prediction [1]. The heart of any Grid system is the information service which allows applications to find resources appropriate for their needs. A centralized information system, such as the Monitoring and Discovery System (MDS) of the Globus Toolkit [2], can however quickly become a performance bottleneck, limiting scalability and introducing a single point of failure. These shortcomings have led to the introduction of peer-to-peer (p2p) information systems that organize MDS directories into a flat p2p network similar to Gnutella [3]. Unfortunately, the proposed protocol is based on flooding query messages, which also limits scalability. Distributed Hash Tables (DHTs), such as Chord [4] and Kademlia [5], offer scalable mechanisms for information lookup, but the use of cryptographic hash functions means that looking up ranges of information is not possible (only specific, well defined keys can be retrieved). Nevertheless, when looking for resources that match the needs of a given application, it s not always possible or necessary to define exact query parameters (e.g., a certain task may need computers that have at least 512 Mb RAM memory), There was a need thus to propose range query algorithms that can answer partially defined queries in a distributed manner. The main problem in designing a range queryable information system for Grid applications lies in the uneven distribution of resources in the attribute space. For attributes with numerical values (such as the amount of memory, CPU speed, etc.), For attributes with numerical values (such as the amount of available memory, or the available free disk space), data might get concentrated on an attribute value interval, but not on a single value. This situation can be successfully handled with current load balancing algorithms. As opposed to this, in the case of string attributes (CPU type, operating system), we might have some values that correspond to the majority of the resources (e.g., most of the machines will use the Windows OS). Thus, the node responsible for such a particular value will have to handle an extremely high load. Current range queryable systems are not able to cope with such uneven load distribution. In this paper, we introduce RESERV (REsource SERVice), a range queryable information system for grid applications with a novel load balancing approach. In RESERV, similarly to previous range query algorithms, we organize resources into a multidimensional attribute space. However, instead of storing data about resources in a distributed database, information about a node s resources is stored in the node s address itself. Thus, finding a resource in RESERV simply means routing a message to a node with specific attribute values. Uneven distribution of nodes in the attribute space will thus affect routing tables instead of data distribution between nodes, and
2 the key problem in RESERV will be load-balanced routing. This approach allows RESERV to operate efficiently even in cases of extremely skewed node distribution in the attribute space. 2. Related work 2.1. Range query algorithms Range query algorithms are generally built over already existing DHTs, or use custom-designed DHTs. Squid [6] and the range query algorithm proposed by Andrzejak et al. [7] have a very similar approach to RESERV. Resources are organized into a multidimensional attribute-space, where each dimension indexes data along one attribute. Squid uses a recursive Hilbert space-filling curve to walk through the overlay network for range queries. Andrzejak et al. also use a Hilbert curve over a DHT to provide range query functionality. MAAN [8] uses a locality preserving hash function over Chord to extend its functionality to range queries, similarly to the solution proposed by Gupta et al. [9]. SWORD [10] also uses a locality-preserving hash function to map data onto a DHT. Mercury [11] uses a routing hub for each attribute; all the hubs have to be contacted successively during a range query. P-Tree [12] supports range queries by using B+ trees that can remain in a temporarily inconsistent state. Brushwood [13] uses a linearized indexing tree for single attribute range queries, and a K-D tree for multi-attribute range queries. correspond to a single attribute-value pair (e.g., for most of the nodes, OS = Windows); in a DHT-based range query algorithm all these data will always be mapped on the same node, and thus, trying to alleviate the load of this node by distributing a range of values among more nodes doesn t help. RESERV, the load balanced information system that we propose in this paper targets exactly these very realistic cases. 3. Distributed resource information service with RESERV 3.1. Background Kademlia Kademlia [5] is one of the most used DHTs in practical applications such as the KAD network, or the trackerless BitTorrent clients. Routing in RESERV is heavily based on the Kademlia DHT; thus, before presenting the details of our approach, we summarize the basic operation of Kademlia. Kademlia uses a 160 bit address space, in which both nodes and keys are mapped. Every node stores data with keys closest to its address, in terms of the binary XOR operator. Every node maintains 160 k- buckets for routing information. The i-th k-bucket contains at most K nodes whose distance from the current node is between i and i+1, where K is a pre-chosen system parameter. Figure 1. shows the address space of a 3-bit Kademlia network. The encircled subtrees correspond to 3-buckets of the node represented by the black dot: 2.2. Load balancing in range query algorithms Load balancing is a critical problem in grid information systems, as data distribution in the attribute space can be very uneven. The above mentioned range query algorithms are all based either on a passive or an active load balancing solution. Passive load balancing, as in SWORD, is accomplished by the locality preserving hash function, which tries to smooth unevenness of data distribution. Active load balancing methods work in two similar ways: nodes with high load try to hand over part of the data they are responsible for (that is, part of the range along one attribute) to less loaded neighbour nodes (as in Squid, for example), or nodes with high load leave the system, and join again with an address corresponding to a less loaded part of the key-space (as in Squid, Mercury, SWORD or Brushwood). However, neither of these methods can cope with extreme load unbalance, where most of the resources Figure 1: Kademlia k-buckets The Kademlia protocol contains four RPC-s that all the functions are built on: PING, to check if a node is still connected; STORE, to store a key and corresponding data; FIND_NODE, with an address as its parameter, to look for the K closest values to the given address; FIND_VALUE, with a key as its parameter; if a node stores data corresponding to the key, the return value is the stored data; otherwise it behaves identically to FIND_NODE. When node A looks for node B with address y, the search goes thus through the following steps:
3 I. Node A creates a list L containing the K closest addresses to y. It first fills this list from its own k- buckets. It also marks every node in the list on which it has already run the FIND_NODE RPC. II. Node A selects α unmarked nodes from the list, and runs the FIND_NODE RPC on them (α is a system-wide parameter). III. Node A updates the list using the return values of the FIND_NODE RPCs, so as to still contain the K closest addresses to y. IV. If A hasn t found the node it was looking for, or the list still contains unmarked nodes, it returns to step II. K-buckets are ordered lists of nodes, with the most recently seen node at the beginning of the list. If we receive a message from another node, we try to insert that node into the appropriate k-bucket, if there s still room. If there s not, we PING the node from the end of the list; if it replies, we move it to the head of the list; if it does not, we delete it from the list, and replace it with the new node. With adequate network traffic, k-buckets remain consistent thanks to the above procedures. A new node joining a Kademlia system simply has to know about one other node already in the system. It chooses a random address for itself, and then searches for its own address. By doing so, it learns about nearby nodes. The new node then fills its k-buckets by selecting random addresses from the node lists returned by the successive FIND_NODE RPCs. In parallel, other nodes also gain knowledge of the new node. When a node leaves the network, it simply copies data stored on it to the node nearest to itself, and disconnects. dimensional attribute space. Of course, no matter which space filling curve we use, some addresses which are near each other in the N-dimensional attribute space will be far from each other on the space-filling curve. We thus create an N-dimensional attribute space (where N is the number of attributes), where nodes occupy a position depending on their attribute values. A node s address along each dimension will have a first part corresponding to the value of that attribute, and a second, random part to differentiate nodes from each other. Figure 2. shows the attribute space for two attributes: system memory (a numerical attribute), and operating system (a string attribute). Figure 2: RESERV attribute space We then use a Z-order space-filling curve to create one-dimensional addresses from the N-dimensional addresses, as shown in Figure 3: 3.2. The RESERV approach The basic idea behind RESERV is that node addresses are not assigned randomly, but depend on the attribute-value pairs corresponding to that node. The address of a node is composed of as many parts as there are attributes. The goal is to give similar addresses to nodes with similar attribute values, in order to facilitate range queries. Let s suppose we want to code each attribute on 10 bits. In the case of string attributes, such as the operating system, we can obtain addresses for example by using a hash function which converts ASCII strings to a 10 bit long binary number. In case of numerical attributes, such as the amount of available memory, this address can be obtained directly, or by using some transformation which preserves locality (for example taking the base 2 logarithm of the original value); Thus nodes with similar attributes will be near each other in the N- Figure 3: Z-order curve application This is accomplished by interleaving bits from each attribute successively, which yields a one-dimensional bit string address. Thus for the example shown on figure 3, the one-dimensional address from attributes with binary values 10 (on the x-axis) and 01 (on the y- axis) will be (by interleaving the first bit from the first attribute, the first bit from the second attribute, the second bit from the first attribute, and finally the second bit from the second attribute. Let s take a more complex example: we have four attributes with the
4 following binary values: , 011, 1, (as we can see in this example, attributes needn t be of the same length). We then write these attribute values in a matrix, as follows: x x x 1 x x x x x x We can obtain the one-dimensional address by reading bits successively from each column and omitting the x fields. Thus, the one dimensional address will be: To avoid address collisions between nodes belonging to the same category, a pre-defined length random bit sequence is added at the end the linearized address of each node. The notion of k-buckets in RESERV is very similar to the original Kademlia network: the i-th k-bucket contains at most K nodes whose distance from the current node is between 2 L-i and 2 L-i+1, where L is the total length of the linearized address of nodes. K- buckets in RESERV will correspond to successively larger and farther away portions of the attribute space from the current node, as shown in Figure 4: 3.3. Node lookup in RESERV As no data is stored in RESERV, we can only look up nodes. There are two types of lookups: simple lookup, where every attribute value is specified, and range lookup, where for some attributes no value is specified, or instead of a value, a range of values is given. The mechanism of simple lookup is identical to the Kademlia search mechanism described in section 3.1.: when looking for a well-specified resource (a node with all attribute values defined), then by using the RESERV addressing mechanism and the Kademlia lookup mechanism, we can find the k closest nodes satisfying the search criteria. For range lookups, we introduce a new RPC: FIND_INTERVAL. In a range lookup, we can specify a list of values, or a range of values for some attributes (or leave the attribute value blank, in which case the range of the lookup will be the entire attribute range). The lookup interval in the attribute space will be the Cartesian product of the specified sets. In order to handle range lookups, we define a new XOR distance metric between an address and a set of addresses, as being the distance between the address, and the address nearest to it in the set. This distance is easy to calculate by exploiting the fact that the set of addresses in the range of the query is the cartesian product of the set of addresses in the range of the query along each attribute. We simply have to find thus the smallest distance along each attribute, and linearize the resulting attribute-value pairs using the Z-order curve. Because a simple greedy range lookup could quickly reach a dead-end, we use binary stochastic beam search Load balancing Figure 4: k-buckets and attribute space of node 0110 However, contrary to Kademlia, where k-buckets are filled randomly with nodes we receive messages from, in RESERV, k-buckets will be filled with the nearest nodes (based on the XOR distance between addresses) from the part of the attribute space which corresponds to each k-bucket. This is achieved by the following mechanism. When a node x joins, it starts a search for the node with address x that is, the nearest node to itself whose address differs in the first bit. After joining, we keep the k nearest nodes in each k-bucket, except in cases where load balancing dictates otherwise (see section 3.4.). As addresses in RESERV are not assigned randomly, nodes corresponding to rare resources would have much more links pointing to them than ordinary nodes, as without load balancing, each node would try to fill its k-buckets uniformly from the address-space. This would mean that these nodes, probably also constituting the most valuable resources in the system, would have to take a disproportionately large part of the system maintenance effort. This is why load balancing of routing tables is a crucial question in RESERV. The principle of load balancing is that every node tries to estimate how many other nodes know of a given node before inserting it into its routing tables. The new node is only inserted in the corresponding k-bucket if the result of this estimation is smaller than K.
5 We achieve this by modifying the original Kademlia k-bucket handling rules. As in Kademlia, whenever a node with address x receives a message from another node with address z, it tries to insert z into its k-buckets. However, a new node z is only inserted into the k- buckets of node x if the number of elements in the set { y y R( x) y z < x z} (where R(x) is the union of all k-buckets of node x) is smaller than K. In other words, x only inserts z into its routing table if it doesn t know about K nodes nearer to z than itself. Each time the k-buckets are updated, the above criteria has to remain true for all nodes in the routing table of node x. If we find a node z in the k-buckets of node x which has more than K nodes nearer to it than x, we delete node z from the routing table. The basis of this load balancing technique is that since every k-bucket of a node x contains the nodes nearest to x, nodes known to x will also know each other with a very high probability, especially in the case of nodes nearer to a target node than x. The use of this load-balancing technique also means that RESERV can run with a very sparsely populated attribute space; the dynamically changing distribution of nodes in the attribute does not affect system performance, and the fact that attribute ranges and granularity is fixed in advance is not a serious limitation. Our first test was to evaluate how this average length depends on the network size, as shown on Figure 5: Figure 5: Number of nodes and route length In this test, we modified the number of connected nodes, with a constant k-bucket size (K=5). As expected, the route length scales sub-linearly with the number of nodes. Figure 6. shows the effect of node distribution on routing path length. We ran the test with N=500 and K=5. However, in this test, connecting nodes didn t choose attribute values uniformly, but with a variable parameter zipf distribution. 4. Evaluation RESERV was implemented in Java as part of a distributed job execution and data storage system. As our approach in creating a distributed resource information system was quite different from previous work, comparing RESERV to other range query algorithms would have made little sense. The goal of our evaluation was to examine the effect of k-bucket size on routing efficiency, scalability, and resilience to skewed node distribution in the address space. Simulations were run on one computer, with each node running as a separate thread. During each test, N nodes were connected sequentially, with each node choosing a random node for bootstrapping. Each node x ran one lookup for the address farthest away from itself in the address space (i.e., the node with address ( x ) ). At the end of the test, the number of FIND_NODE RPCs was divided by N, giving us the average length of the longest possible lookup in the system. Figure 6: Zipf node distribution with parameter S and routing length The results might seem surprising at first: we get a shorter routing path length for a more uneven node distribution. The explanation is however simple: with a more uneven distribution, a larger proportion of nodes will have an address with the same prefix. To calculate average routing path length, we take into account a lookup performed by each node; thus, many nodes with similar address will compensate for bad results achieved by rare nodes. This does not mean that an unbalanced distribution is an advantage, especially if we look for rare nodes. Figures 7. and 8. show the number of links pointing to rare nodes without and with load balancing. In these tests, we were not interested in routing path length, but rather in the effects of load balancing.
6 Network size was 500 nodes, with K=5. To further increase the unbalance, every node joined through the same initial node. After the join process, we examined the number of links pointing to a given node. For these tests, we calculated the number of links pointing to the most popular node, the least popular node, the average number of links, and the standard deviation of the number of links. On the first figure, we didn t represent the most popular node, which was the initial node: all the 499 other nodes kept a link to it in their routing tables in every test. The most representative data is the high standard deviation. Figure 8: Number of connections with load balancing On Figure 8. we can see that at most about 60 links point to the most popular node instead of 499, and that with load balancing the standard deviation of the number of links is much lower. These tests show that our load balancing scheme is working as expected. 5. Conclusion The goal of RESERV was to create a distributed information system for grid applications that can handle uneven distribution of data which can arise in the case of resource attributes with discrete values. As our tests show, load balancing did not affect the O(logN) routing complexity typical to DHT systems. RESERV is thus a solution that supports load balancing even in cases of extremely skewed distributions, while preserving scalability and routing efficiency. After these initial encouraging results, we plan to deploy RESERV on PlanetLab to test in on a larger scale and in a real network environment. Figure 7: Number of connections without load balancing 6. References [1] I. Foster, C. Kesselman: The grid: blueprint for a new computing infrastructure, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, [2] I. Foster, C. Kesselman: Globus: a Metacomputing Infrastructure Toolkit, Int. Journal of High Performance Computing Applications, vol. 11, no. 2, [3] A. Iamnitchi, I. Foster, D. Nurmi. A peer-to-peer approach to resource discovery in grid environments, Proc. of the 11th Symposium on High Performance Distributed Computing, [4] I. Stoica, et al, "Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications," IEEE/ACM Transactions on Networking, Vol. 11, No. 1, pp , February [5] P. Maymounkov, D. Mazires: Kademlia: A peer-to-peer information system based on the XOR metric, Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, Mar [6] C. Schmidt, M. Parashar, "Enabling Flexible Queries with Guarantees in P2P Systems," IEEE Internet Computing, Vol. 8, No. 3, pp , May/June [7] A. Andrzejak, Z. Xu, "Scalable Efficient Range Queries for Grid Information Services," Proc. IEEE P2P 2002, Linköping, Sweden, September [8] M. Cai, M. Frank, J. Chen, P. Szekely, MAAN: A Multi-Attribute Addressable Network for Grid Information Services, Journal of Grid Computing, Springer, [9] A. Gupta, D. Agrawal, A. El Abbadi, "Approximate Range Selection Queries in Peer-to-Peer Systems," Proc. of CIDR 03, Asilomar, California, USA, January [10] D. Oppenheimer, J. Albrecht, D. Patterson, A. Vahdat, "Distributed Resource Discovery on Planetlab with SWORD," Proc. of WORLDS 04, Santa Fe, New Mexico, USA, December [11] A. R. Bharambe, M. Agrawal, S. Seshan, "Mercury: Supporting Scalable Multi-attribute Range Queries," Proc. SIGCOMM 04, Portland, Oregon, USA, [12] A. Crainiceanu, et al, "PTree: A P2P Index for Resource Discovery Applications," Proc. of WWW 04, New York, USA, May [13] C. Zhang, A. Krishnamurthy, R. Y. Wang, "Brushwood: Distributed Trees in Peer-to-Peer Systems," Proc. of IPTPS 05, New York, USA, 2005.
International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 Load Balancing Heterogeneous Request in DHT-based P2P Systems Mrs. Yogita A. Dalvi Dr. R. Shankar Mr. Atesh
More informationInternational journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.
RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article
More informationDistributed Hash Tables in P2P Systems - A literary survey
Distributed Hash Tables in P2P Systems - A literary survey Timo Tanner Helsinki University of Technology tstanner@cc.hut.fi Abstract Distributed Hash Tables (DHT) are algorithms used in modern peer-to-peer
More informationDepartment of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing
Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to
More informationObject Request Reduction in Home Nodes and Load Balancing of Object Request in Hybrid Decentralized Web Caching
2012 2 nd International Conference on Information Communication and Management (ICICM 2012) IPCSIT vol. 55 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V55.5 Object Request Reduction
More informationPEER-TO-PEER (P2P) systems have emerged as an appealing
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 21, NO. 4, APRIL 2009 595 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems Quang Hieu Vu, Member, IEEE, Beng Chin Ooi,
More informationA Load Balancing Method in SiCo Hierarchical DHT-based P2P Network
1 Shuang Kai, 2 Qu Zheng *1, Shuang Kai Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn 2, Qu Zheng Beijing University of Posts and Telecommunications, buptquzheng@gmail.com Abstract
More informationNew Structured P2P Network with Dynamic Load Balancing Scheme
New Structured P2P Network with Dynamic Load Balancing Scheme Atushi TAKEDA, Takuma OIDE and Akiko TAKAHASHI Department of Information Science, Tohoku Gakuin University Department of Information Engineering,
More informationVaralakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
More informationIPTV AND VOD NETWORK ARCHITECTURES. Diogo Miguel Mateus Farinha
IPTV AND VOD NETWORK ARCHITECTURES Diogo Miguel Mateus Farinha Instituto Superior Técnico Av. Rovisco Pais, 1049-001 Lisboa, Portugal E-mail: diogo.farinha@ist.utl.pt ABSTRACT IPTV and Video on Demand
More informationA PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM
A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM Dr.S. DHANALAKSHMI 1, R. ANUPRIYA 2 1 Prof & Head, 2 Research Scholar Computer Science and Applications, Vivekanandha College of Arts and Sciences
More informationA Self-Managing SIP-based IP Telephony System based on a P2P approach using Kademlia
A Self-Managing SIP-based IP Telephony System based on a P2P approach using Kademlia Felipe de Castro Louback Rocha 1, Linnyer Beatriz 1 Programa de Pós Graduação em Engenharia Elétrica, Universidade Federal
More informationLoad Balancing in Structured Overlay Networks. Tallat M. Shafaat tallat(@)kth.se
Load Balancing in Structured Overlay Networks Tallat M. Shafaat tallat(@)kth.se Overview Background The problem : load imbalance Causes of load imbalance Solutions But first, some slides from previous
More informationDistributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
More informationData Warehousing und Data Mining
Data Warehousing und Data Mining Multidimensionale Indexstrukturen Ulf Leser Wissensmanagement in der Bioinformatik Content of this Lecture Multidimensional Indexing Grid-Files Kd-trees Ulf Leser: Data
More informationJoin and Leave in Peer-to-Peer Systems: The DASIS Approach
Join and Leave in Peer-to-Peer Systems: The DASIS Approach Keno Albrecht, Ruedi Arnold, Michael Gähwiler, Roger Wattenhofer {kenoa@inf, rarnold@inf, mgaehwil@student, wattenhofer@inf}.ethz.ch Department
More informationA P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT
A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT CATALOGUES Lican Huang Institute of Network & Distributed Computing, Zhejiang Sci-Tech University, No.5, St.2, Xiasha Higher Education Zone, Hangzhou,
More informationRESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT
RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT Bilkent University 1 OUTLINE P2P computing systems Representative P2P systems P2P data management Incentive mechanisms Concluding remarks Bilkent University
More information8 Conclusion and Future Work
8 Conclusion and Future Work This chapter concludes this thesis and provides an outlook on future work in the area of mobile ad hoc networks and peer-to-peer overlay networks 8.1 Conclusion Due to the
More informationD1.1 Service Discovery system: Load balancing mechanisms
D1.1 Service Discovery system: Load balancing mechanisms VERSION 1.0 DATE 2011 EDITORIAL MANAGER Eddy Caron AUTHORS STAFF Eddy Caron, Cédric Tedeschi Copyright ANR SPADES. 08-ANR-SEGI-025. Contents Introduction
More informationLecture 25: Security Issues in Structured Peer-to-Peer Networks. Lecture Notes on Computer and Network Security. by Avi Kak (kak@purdue.
Lecture 25: Security Issues in Structured Peer-to-Peer Networks Lecture Notes on Computer and Network Security by Avi Kak (kak@purdue.edu) April 16, 2015 10:33am c 2015 Avinash Kak, Purdue University Goals:
More informationSOLVING LOAD REBALANCING FOR DISTRIBUTED FILE SYSTEM IN CLOUD
International Journal of Advances in Applied Science and Engineering (IJAEAS) ISSN (P): 2348-1811; ISSN (E): 2348-182X Vol-1, Iss.-3, JUNE 2014, 54-58 IIST SOLVING LOAD REBALANCING FOR DISTRIBUTED FILE
More informationLOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM
LOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM IN PEER TO PEER NETWORKS R. Vijayalakshmi and S. Muthu Kumarasamy Dept. of Computer Science & Engineering, S.A. Engineering College Anna University, Chennai,
More informationOptimizing and Balancing Load in Fully Distributed P2P File Sharing Systems
Optimizing and Balancing Load in Fully Distributed P2P File Sharing Systems (Scalable and Efficient Keyword Searching) Anh-Tuan Gai INRIA Rocquencourt anh-tuan.gai@inria.fr Laurent Viennot INRIA Rocquencourt
More informationLoad Balancing on a Grid Using Data Characteristics
Load Balancing on a Grid Using Data Characteristics Jonathan White and Dale R. Thompson Computer Science and Computer Engineering Department University of Arkansas Fayetteville, AR 72701, USA {jlw09, drt}@uark.edu
More informationUsing Peer to Peer Dynamic Querying in Grid Information Services
Using Peer to Peer Dynamic Querying in Grid Information Services Domenico Talia and Paolo Trunfio DEIS University of Calabria HPC 2008 July 2, 2008 Cetraro, Italy Using P2P for Large scale Grid Information
More informationHow To Create A P2P Network
Peer-to-peer systems INF 5040 autumn 2007 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Inherent restrictions of the standard client/server model Centralised
More informationDesign and Implementation of Performance Guaranteed Symmetric Load Balancing Algorithm
Design and Implementation of Performance Guaranteed Symmetric Load Balancing Algorithm Shaik Nagoor Meeravali #1, R. Daniel *2, CH. Srinivasa Reddy #3 # M.Tech, Department of Information Technology, Vignan's
More informationKrunal Patel Department of Information Technology A.D.I.T. Engineering College (G.T.U.) India. Fig. 1 P2P Network
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure Peer-to-Peer
More informationPSON: A Scalable Peer-to-Peer File Sharing System Supporting Complex Queries
PSON: A Scalable Peer-to-Peer File Sharing System Supporting Complex Queries Jyoti Ahuja, Jun-Hong Cui, Shigang Chen, Li Lao jyoti@engr.uconn.edu, jcui@cse.uconn.edu, sgchen@cise.ufl.edu, llao@cs.ucla.edu
More informationWeb Service Based Data Management for Grid Applications
Web Service Based Data Management for Grid Applications T. Boehm Zuse-Institute Berlin (ZIB), Berlin, Germany Abstract Web Services play an important role in providing an interface between end user applications
More informationThe Role and uses of Peer-to-Peer in file-sharing. Computer Communication & Distributed Systems EDA 390
The Role and uses of Peer-to-Peer in file-sharing Computer Communication & Distributed Systems EDA 390 Jenny Bengtsson Prarthanaa Khokar jenben@dtek.chalmers.se prarthan@dtek.chalmers.se Gothenburg, May
More informationSCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS *
SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS * Maha Abdallah LIP6, Université Paris 6, rue du Capitaine Scott 75015 Paris, France Maha.Abdallah@lip6.fr Hung Cuong Le
More informationA NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE
A NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE S.H.L. Liang Department of Geomatics Engineering, University of Calgary, Calgary, Alberta, CANADA T2N 1N4 steve.liang@ucalgary.ca Commission
More informationMIDAS: Multi-Attribute Indexing for Distributed Architecture Systems
MIDAS: Multi-Attribute Indexing for Distributed Architecture Systems George Tsatsanifos (NTUA) Dimitris Sacharidis (R.C. Athena ) Timos Sellis (NTUA, R.C. Athena ) 12 th International Symposium on Spatial
More informationA Distributed Architecture for Multi-dimensional Indexing and Data Retrieval in Grid Environments
A Distributed Architecture for Multi-dimensional Indexing and Data Retrieval in Grid Environments Athanasia Asiki, Katerina Doka, Ioannis Konstantinou, Antonis Zissimos and Nectarios Koziris National Technical
More informationLoad Balancing in Peer-to-Peer Data Networks
Load Balancing in Peer-to-Peer Data Networks David Novák Masaryk University, Brno, Czech Republic xnovak8@fi.muni.cz Abstract. One of the issues considered in all Peer-to-Peer Data Networks, or Structured
More informationNew Algorithms for Load Balancing in Peer-to-Peer Systems
New Algorithms for Load Balancing in Peer-to-Peer Systems David R. Karger Matthias Ruhl MIT Laboratory for Computer Science Cambridge, MA 02139, USA {karger, ruhl}@theory.lcs.mit.edu Abstract Load balancing
More informationCooperative Monitoring for Internet Data Centers
Cooperative Monitoring for Internet Data Centers Kuai Xu Feng Wang Arizona State University Division of Mathematical and Natural Sciences New College of Interdisciplinary Arts & Sciences P.O. Box 371,
More informationAchieving Resilient and Efficient Load Balancing in DHT-based P2P Systems
Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems Di Wu, Ye Tian and Kam-Wing Ng Department of Computer Science & Engineering The Chinese University of Hong Kong Shatin, N.T., Hong
More informationAn Optimization Model of Load Balancing in P2P SIP Architecture
An Optimization Model of Load Balancing in P2P SIP Architecture 1 Kai Shuang, 2 Liying Chen *1, First Author, Corresponding Author Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn
More informationA Reputation Management System in Structured Peer-to-Peer Networks
A Reputation Management System in Structured Peer-to-Peer Networks So Young Lee, O-Hoon Kwon, Jong Kim and Sung Je Hong Dept. of Computer Science & Engineering, Pohang University of Science and Technology
More informationA Novel Load Balancing Mechanism for P2P Networking
A Novel Load Balancing Mechanism for P2P Networking Leonidas Lymberopoulos National Technical University of Athens 9 Iroon Polytechneiou 578, Athens,Greece +3 2 772 448 leonidas@netmode.ntua.gr Symeon
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More informationA Survey on Distributed Hash Table (DHT): Theory, Platforms, and Applications. Hao Zhang, Yonggang Wen, Haiyong Xie, and Nenghai Yu
A Survey on Distributed Hash Table (DHT): Theory, Platforms, and Applications Hao Zhang, Yonggang Wen, Haiyong Xie, and Nenghai Yu July 5, 2013 2 ABSTRACT Distributed Hash Table (DHT) plays an important
More informationHigh Throughput Computing on P2P Networks. Carlos Pérez Miguel carlos.perezm@ehu.es
High Throughput Computing on P2P Networks Carlos Pérez Miguel carlos.perezm@ehu.es Overview High Throughput Computing Motivation All things distributed: Peer-to-peer Non structured overlays Structured
More informationChord - A Distributed Hash Table
Kurt Tutschku Vertretung - Professur Rechnernetze und verteilte Systeme Chord - A Distributed Hash Table Outline Lookup problem in Peer-to-Peer systems and Solutions Chord Algorithm Consistent Hashing
More informationLocality Based Protocol for MultiWriter Replication systems
Locality Based Protocol for MultiWriter Replication systems Lei Gao Department of Computer Science The University of Texas at Austin lgao@cs.utexas.edu One of the challenging problems in building replication
More informationAn Efficient Index for Massive IOT Data in Cloud Environment
An Efficient Index for Massive IOT Data in Cloud Environment Youzhong Ma,2 Jia Rao Weisong Hu Xiaofeng Meng Xu Han Yu Zhang Yunpeng Chai Chunqiu Liu School of Information, Renmin University, Beijing, China
More informationFile Management. Chapter 12
Chapter 12 File Management File is the basic element of most of the applications, since the input to an application, as well as its output, is usually a file. They also typically outlive the execution
More informationIMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE IMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION N.Vijaya Sunder Sagar 1, M.Dileep Kumar 2, M.Nagesh 3, Lunavath Gandhi
More informationLoad Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems DR.K.P.KALIYAMURTHIE 1, D.PARAMESWARI 2 Professor and Head, Dept. of IT, Bharath University, Chennai-600 073 1 Asst. Prof. (SG), Dept. of Computer Applications,
More informationLoad Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems Dr.K.P.Kaliyamurthie 1, D.Parameswari 2 1.Professor and Head, Dept. of IT, Bharath University, Chennai-600 073. 2.Asst. Prof.(SG), Dept. of Computer Applications,
More informationA Topology-Aware Relay Lookup Scheme for P2P VoIP System
Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme
More informationA Survey Study on Monitoring Service for Grid
A Survey Study on Monitoring Service for Grid Erkang You erkyou@indiana.edu ABSTRACT Grid is a distributed system that integrates heterogeneous systems into a single transparent computer, aiming to provide
More informationIndex Terms : Load rebalance, distributed file systems, clouds, movement cost, load imbalance, chunk.
Load Rebalancing for Distributed File Systems in Clouds. Smita Salunkhe, S. S. Sannakki Department of Computer Science and Engineering KLS Gogte Institute of Technology, Belgaum, Karnataka, India Affiliated
More informationBloom Filter based Inter-domain Name Resolution: A Feasibility Study
Bloom Filter based Inter-domain Name Resolution: A Feasibility Study Konstantinos V. Katsaros, Wei Koong Chai and George Pavlou University College London, UK Outline Inter-domain name resolution in ICN
More informationMASHUPS are an icon of Web 2.0 applications. A
, 23-25 October, 2013, San Francisco, USA MashChord: A Structured Peer-to-Peer Architecture for Mashups Based on Chord Osama Al-Haj Hassan, Ashraf Odeh, and Anas Abu Taleb Abstract Mashups are key category
More informationLoad Balancing in Structured P2P Systems
1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica ananthar, karthik, sonesh, karp, istoica @cs.berkeley.edu Abstract Most P2P systems
More informationPeer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing
Peer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing (Research Proposal) Abhishek Agrawal (aagrawal@acis.ufl.edu) Abstract This proposal discusses details about Peer-VM which is a peer-to-peer
More informationSimilarity Search in a Very Large Scale Using Hadoop and HBase
Similarity Search in a Very Large Scale Using Hadoop and HBase Stanislav Barton, Vlastislav Dohnal, Philippe Rigaux LAMSADE - Universite Paris Dauphine, France Internet Memory Foundation, Paris, France
More informationEfficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems
Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems Kunwadee Sripanidkulchai Bruce Maggs Hui Zhang Carnegie Mellon University, Pittsburgh, PA 15213 {kunwadee,bmm,hzhang}@cs.cmu.edu
More informationDistributed file system in cloud based on load rebalancing algorithm
Distributed file system in cloud based on load rebalancing algorithm B.Mamatha(M.Tech) Computer Science & Engineering Boga.mamatha@gmail.com K Sandeep(M.Tech) Assistant Professor PRRM Engineering College
More informationDYNAMIC LOAD BALANCING IN A DECENTRALISED DISTRIBUTED SYSTEM
DYNAMIC LOAD BALANCING IN A DECENTRALISED DISTRIBUTED SYSTEM 1 Introduction In parallel distributed computing system, due to the lightly loaded and overloaded nodes that cause load imbalance, could affect
More informationAn Efficient Distributed Load Balancing For DHT-Based P2P Systems
An Efficient Distributed Load Balancing For DHT-Based P2P Systems Chahita Taank 1, Rajesh Bharati 2 1 PG Student, 2 Professor, Computer Engineering Dept DYPIET, PUNE. Abstract- In a distributed system
More informationPROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS
PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS Hongye Fu, Naoki Wakamiya, Masayuki Murata Graduate School of Information Science and Technology Osaka University
More informationComparison on Different Load Balancing Algorithms of Peer to Peer Networks
Comparison on Different Load Balancing Algorithms of Peer to Peer Networks K.N.Sirisha *, S.Bhagya Rekha M.Tech,Software Engineering Noble college of Engineering & Technology for Women Web Technologies
More informationA Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks
1 A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks Hasan Sözer, Metin Tekkalmaz, and İbrahim Körpeoğlu Abstract File sharing in wireless ad-hoc networks in a peerto-peer manner imposes many
More informationCompact Representations and Approximations for Compuation in Games
Compact Representations and Approximations for Compuation in Games Kevin Swersky April 23, 2008 Abstract Compact representations have recently been developed as a way of both encoding the strategic interactions
More informationDUP: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks
: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks Liangzhong Yin and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University University Park, PA 16802
More informationA Self-Organized Grouping (SOG) Framework for Efficient Grid Resource Discovery
Journal of Grid Computing manuscript No. (will be inserted by the editor) A Self-Organized Grouping (SOG) Framework for Efficient Grid Resource Discovery Anand Padmanabhan Sukumar Ghosh Shaowen Wang Received:
More informationDistance Degree Sequences for Network Analysis
Universität Konstanz Computer & Information Science Algorithmics Group 15 Mar 2005 based on Palmer, Gibbons, and Faloutsos: ANF A Fast and Scalable Tool for Data Mining in Massive Graphs, SIGKDD 02. Motivation
More informationPersistent Binary Search Trees
Persistent Binary Search Trees Datastructures, UvA. May 30, 2008 0440949, Andreas van Cranenburgh Abstract A persistent binary tree allows access to all previous versions of the tree. This paper presents
More informationSUITABLE ROUTING PATH FOR PEER TO PEER FILE TRANSFER
SUITABLE ROUTING PATH FOR PEER TO PEER FILE TRANSFER R. Naga Priyadarsini, S. Suma and V. Dhanakoti Department of Computer Science Engineering, Valliammai Engineering College, Kanchipuram, India ABSTRACT
More informationAn Introduction to Peer-to-Peer Networks
An Introduction to Peer-to-Peer Networks Presentation for MIE456 - Information Systems Infrastructure II Vinod Muthusamy October 30, 2003 Agenda Overview of P2P Characteristics Benefits Unstructured P2P
More informationAn Evaluation of Self-adjusting Binary Search Tree Techniques
SOFTWARE PRACTICE AND EXPERIENCE, VOL. 23(4), 369 382 (APRIL 1993) An Evaluation of Self-adjusting Binary Search Tree Techniques jim bell and gopal gupta Department of Computer Science, James Cook University,
More informationP2P File Sharing: BitTorrent in Detail
ELT-53206 Peer-to-Peer Networks P2P File Sharing: BitTorrent in Detail Mathieu Devos Tampere University of Technology Department of Electronics & Communications Engineering mathieu.devos@tut.fi TG406 2
More informationA Comparison of Mobile Peer-to-peer File-sharing Clients
1. ABSTRACT A Comparison of Mobile Peer-to-peer File-sharing Clients Imre Kelényi 1, Péter Ekler 1, Bertalan Forstner 2 PHD Students 1, Assistant Professor 2 Budapest University of Technology and Economics
More informationDecentralized Service Discovery Approach Using Dynamic Virtual Server
Decentralized Service Discovery Approach Using Virtual N.Aravindhu 1, C.Shalini 2, R.Jayalakshmi 3, S.Priyavadhani 4 Assistant Professor, Department of Computer Science, Christ College of Eng. and Technology,
More informationMultimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.
Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 14 Previous Lecture 13 Indexes for Multimedia Data 13.1
More informationStorage Systems Autumn 2009. Chapter 6: Distributed Hash Tables and their Applications André Brinkmann
Storage Systems Autumn 2009 Chapter 6: Distributed Hash Tables and their Applications André Brinkmann Scaling RAID architectures Using traditional RAID architecture does not scale Adding news disk implies
More informationTrace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic
Trace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic William Acosta and Surendar Chandra University of Notre Dame, Notre Dame IN, 46556, USA {wacosta,surendar}@cse.nd.edu Abstract.
More informationThe Advantages and Disadvantages of Network Computing Nodes
Big Data & Scripting storage networks and distributed file systems 1, 2, in the remainder we use networks of computing nodes to enable computations on even larger datasets for a computation, each node
More informationEfficient Multi-Feature Index Structures for Music Data Retrieval
header for SPIE use Efficient Multi-Feature Index Structures for Music Data Retrieval Wegin Lee and Arbee L.P. Chen 1 Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 300,
More informationMulti-dimensional index structures Part I: motivation
Multi-dimensional index structures Part I: motivation 144 Motivation: Data Warehouse A definition A data warehouse is a repository of integrated enterprise data. A data warehouse is used specifically for
More informationPlaxton routing. Systems. (Pastry, Tapestry and Kademlia) Pastry: Routing Basics. Pastry: Topology. Pastry: Routing Basics /3
Uni Innsbruck Informatik Uni Innsbruck Informatik Peerto topeer Systems DHT examples, part (Pastry, Tapestry and Kademlia) Michael Welzl michael.welzl@uibk.ac.at DPS NSG Team http://dps.uibk.ac.at dps.uibk.ac.at/nsg
More informationEnhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery
Enhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery De-Ke Guo 1, Hong-Hui Chen 1, Xian-Gang Luo 2,Xue-Shan Luo 1, Wei-Ming Zhang 1 1 School of Information
More informationPerformance Workload Design
Performance Workload Design The goal of this paper is to show the basic principles involved in designing a workload for performance and scalability testing. We will understand how to achieve these principles
More informationDynamic Load Balancing for Cluster-based Publish/Subscribe System
Dynamic Load Balancing for Cluster-based Publish/Subscribe System Hojjat Jafarpour, Sharad Mehrotra and Nalini Venkatasubramanian Department of Computer Science University of California, Irvine {hjafarpo,
More informationBitTorrent Management and the Advantages of distributing Free Software
apt-p2p: A Peer-to-Peer Distribution System for Software Package Releases and Updates Cameron Dale School of Computing Science Simon Fraser University Burnaby, British Columbia, Canada Email: camerond@cs.sfu.ca
More informationEfficient Search in Gnutella-like Small-World Peerto-Peer
Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, 410073 Changsha, China
More informationMerkle Hash Trees for Distributed Audit Logs
Merkle Hash Trees for Distributed Audit Logs Subject proposed by Karthikeyan Bhargavan Karthikeyan.Bhargavan@inria.fr April 7, 2015 Modern distributed systems spread their databases across a large number
More informationImplementing Parameterized Dynamic Load Balancing Algorithm Using CPU and Memory
Implementing Parameterized Dynamic Balancing Algorithm Using CPU and Memory Pradip Wawge 1, Pritish Tijare 2 Master of Engineering, Information Technology, Sipna college of Engineering, Amravati, Maharashtra,
More informationLecture 2 February 12, 2003
6.897: Advanced Data Structures Spring 003 Prof. Erik Demaine Lecture February, 003 Scribe: Jeff Lindy Overview In the last lecture we considered the successor problem for a bounded universe of size u.
More informationImproving Query Processing Performance in Large Distributed Database Management Systems
Norvald H. Ryeng Improving Query Processing Performance in Large Distributed Database Management Systems Thesis for the degree of Philosophiae Doctor Trondheim, November 2011 Norwegian University of Science
More informationLecture 14: Managing Mobility. Rik Sarkar
Lecture 14: Managing Mobility Rik Sarkar Communica9on with mobile nodes How do cell phones work? How can we talk to mobile nodes without the cell infrastructure? How do mobile phones work? There are large
More informationArgonne National Laboratory, Argonne, IL USA 60439
LEGS: A WSRF Service to Estimate Latency between Arbitrary Hosts on the Internet R Vijayprasanth 1, R Kavithaa 2,3, and Rajkumar Kettimuthu 2,3 1 Department of Information Technology Coimbatore Institute
More informationquery enabled P2P networks 2009. 08. 27 Park, Byunggyu
Load balancing mechanism in range query enabled P2P networks 2009. 08. 27 Park, Byunggyu Background Contents DHT(Distributed Hash Table) Motivation Proposed scheme Compression based Hashing Load balancing
More informationA Content-Based Load Balancing Algorithm for Metadata Servers in Cluster File Systems*
A Content-Based Load Balancing Algorithm for Metadata Servers in Cluster File Systems* Junho Jang, Saeyoung Han, Sungyong Park, and Jihoon Yang Department of Computer Science and Interdisciplinary Program
More informationUsing Content-Addressable Networks for Load Balancing in Desktop Grids (Extended Version)
Using Content-Addressable Networks for Load Balancing in Desktop Grids (Extended Version) Jik-Soo Kim, Peter Keleher, Michael Marsh, Bobby Bhattacharjee and Alan Sussman UMIACS and Department of Computer
More information