{"title":"A QoS-Aware Heuristic Algorithm for Replica Placement","authors":"Hsiangkai Wang, Pangfeng Liu, Jan-Jan Wu","doi":"10.1109/ICGRID.2006.311003","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311003","url":null,"abstract":"This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality assurance is very important, especially in heterogeneous environments. We propose a new heuristic algorithm that determines the positions of replicas in order to satisfy the quality requirements imposed by data requests. The experimental results indicate that the proposed algorithm finds a near-optimal solution effectively and efficiently for algorithm can also adapt to various parallel and distributed environments","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"108 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116471750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Shibboleth-based Access to and Usage of Grid Resources","authors":"R. Sinnott, Jipu Jiang, J. Watt, O. Ajayi","doi":"10.1109/ICGRID.2006.311008","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311008","url":null,"abstract":"Security underpins grids and e-research. Without a robust, reliable and simple grid security infrastructure combined with commonly accepted security practices, large portions of the research community and wider industry will not engage. The predominant way in which security is currently addressed in the grid community is through public key infrastructures (PKI) based upon X.509 certificates to support authentication. Whilst PKIs address user identity issues, authentication does not provide fine grained control over what users are allowed to do on remote resources (authorization). In this paper we outline how we have successfully combined Shibboleth and advanced authorization technologies to provide simplified (from the user perspective) but fine grained security for access to and usage of grid resources. We demonstrate this approach through different security focused e-science projects being conducted at the National e-Science Centre (NeSC) at the University of Glasgow. We believe that this model is widely applicable and encourage the further uptake of e-science by non-IT specialists in the research communities","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123383686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mehran Ahsant, J. Basney, Olle Mulmo, Adam J. Lee, Lennart Johnsson
{"title":"Toward an On-Demand Restricted Delegation Mechanism for Grids","authors":"Mehran Ahsant, J. Basney, Olle Mulmo, Adam J. Lee, Lennart Johnsson","doi":"10.1109/ICGRID.2006.311010","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311010","url":null,"abstract":"Grids are intended to enable cross-organizational interactions which makes grid security a challenging and non-trivial issue. In grids, delegation is a key facility that can be used to authenticate and authorize requests on behalf of disconnected users. In current grid systems there is a tradeoff between flexibility and security in the context of delegation. Applications must choose between limited or full delegation: on one hand, delegating a restricted set of rights reduces exposure to attack but also limits the flexibility/dynamism of the application; on the other hand, delegating all rights provides maximum flexibility but increases exposure. In this paper, we propose an on-demand restricted delegation mechanism, aimed at addressing the shortcomings of current delegation mechanisms by providing restricted delegation in a flexible fashion as needed for grid applications. This mechanism provides an ontology-based solution for tackling one the most challenging issues in security systems, which is the principle of least privileges. It utilizes a callback mechanism, which allows on-demand provisioning of delegated credentials in addition to observing, screening, and auditing delegated rights at runtime. This mechanism provides support for generating delegation credentials with a very limited and well-defined range of capabilities or policies, where a delegator is able to grant a delegatee a set of restricted and limited rights, implicitly or explicitly","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125507988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QoS Support For Workflows In A Volatile Grid","authors":"Y. Patel, Andrew McGough, J. Darlington","doi":"10.1109/ICGRID.2006.310999","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.310999","url":null,"abstract":"The grid can be seen as a collection of services each of which performs some functionality. Users of the grid seek to use combinations of these services to perform the overall task they need to achieve. In general this can be seen as a set of services with a workflow document describing how these services should be combined. The user may also have certain constraints on the workflow operations, such as execution time or cost to the user, specified in the form of a quality of service (QoS) document. The users submit their workflow to a brokering service along with the QoS document. The brokering service's task is to map any given workflow to a subset of the grid services taking the QoS and state of the grid into account - service availability and performance. We propose in this paper an approach for generating constraint equations describing the workflow, the QoS requirements and the state of the grid. This set of equations may be solved using mixed-integer linear programming (MILP), which is the traditional method. We further develop a novel 2-stage stochastic MILP which is capable of dealing with the volatile nature of the grid and adapting the selection of the services during the lifetime of the workflow. We present experimental results comparing our approaches, showing that the 2-stage stochastic programming approach performs consistently better than other traditional approaches","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128355315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yuya Machida, Shin'ichiro Takizawa, H. Nakada, S. Matsuoka
{"title":"Multi-Replication with Intelligent Staging in Data-Intensive Grid Applications","authors":"Yuya Machida, Shin'ichiro Takizawa, H. Nakada, S. Matsuoka","doi":"10.1109/ICGRID.2006.311002","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311002","url":null,"abstract":"Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when the application/workflow scales, we observe considerable degradations in performance, compared to processing within a tightly-coupled cluster. For example, when numerous nodes access the same set of files simultaneously, major performance degradation occurs even if replicas are used, due to bottlenecks that manifest in the infrastructure. Instead of resorting to expensive solutions such as parallel file systems, we propose alleviating the situation by tightly coupling replica and data transfer management with computation scheduling. In particular we propose three techniques: (1) dynamic aggregation and O(1) replication of data-staging requests across multiple nodes using a multi-replication framework, (2) replica-centric scheduling - data re-use and time-to-replication as compute scheduling metrics on the grid and (3) overlapped execution of data staging and compute bound tasks. Early benchmark results implemented in our prototype Condor-like grid scheduling system demonstrate that the techniques are quite effective in eliminating much of the overhead in data transfers in many cases","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122374951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Flexible and Secure Logging of Grid Data Access","authors":"Weide Zhang, D. Vecchio, G. Wasson, M. Humphrey","doi":"10.1109/ICGRID.2006.311001","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311001","url":null,"abstract":"In grid collaborations, scientists use middleware to execute computational experiments, visualize results, and securely share data on resources ranging from desktop machines to supercomputers. While there has been significant effort in authentication and authorization for these distributed infrastructures, it is still difficult to determine, post-facto, exactly what information might have been accessed, what operations might have occurred, and for what reasons. To address this problem, we have designed and implemented a secure logging infrastructure for grid data access. We uniquely leverage and extend XACML with new capabilities so that data owners can specify logging policies and these policies can be used to engage logging mechanisms to record events of interest to the data owners. A case study based on GridFTP.NET is presented and analyzed, utilizing both local storage of log records and remote storage via SAWS, an independently developed secure audit Web service. We show that with relatively little performance overhead, data owners are provided with new flexibility for determining the post-facto conditions under which their grid data was accessed","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115906972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ramon Nou, F. Julià, David Carrera, Kevin Hogan, Jordi Caubet, Jesús Labarta, J. Torres
{"title":"Monitoring and analysing a Grid Middleware Node","authors":"Ramon Nou, F. Julià, David Carrera, Kevin Hogan, Jordi Caubet, Jesús Labarta, J. Torres","doi":"10.1109/ICGRID.2006.311033","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311033","url":null,"abstract":"Distributed grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces of software. But as grid middlewares grow and offer more advanced features, they become more complex and weighty, as well as hard to tune. As the performance of a distributed grid applications can be strongly influenced by the operation of the underlying grid middleware, it becomes important to study and analyze their behaviour and performance. In this paper we present the eDragon monitoring framework (eDMF), a set of tools for instrumentation and analysis of grid middleware, that provides an unique environment to study the performance of grid applications. The eDMF is composed of a set of specialised monitoring tools as well as a flexible and powerful performance analysis platform. Additionally we also provide a practical application of the eDMF to the Globus toolkit 4 (GT4), one of the most extended and popular grid middlewares, showing how it helped us in the detection and resolution of several job management problems observed in the GT4 middleware","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115613431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"YA: Fast and Scalable Discovery of Idle CPUs in a P2P network.","authors":"Javier Celaya, U. Arronategui","doi":"10.1109/ICGRID.2006.310997","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.310997","url":null,"abstract":"Discovery of large amounts of idle CPUs in fully distributed and shared grid systems is needed in relevant applications and is still a challenging problem. In this paper we present a fast, scalable and efficient discovery protocol founded on a tree-based peer-to-peer (p2p) network with fault-tolerant capabilities and locality features. Each system node stores a good estimation of the number of CPUs that are available in its branch. Each node notifies its father about changes in this value only when it is meaningful enough. This allows low overhead and a stable behavior with concurrent and dynamic allocation of CPUs. This basic mechanism allows any node to launch a discovery process that needs only to follow the information of free CPUs in each branch. Results from experiments and simulation tests, using a simple allocation method, show discovery time scaling logarithmically with the number of nodes","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126110253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Infrastructure for Dynamic Composition of Grid Services","authors":"Z. Li, M. Parashar","doi":"10.1109/ICGRID.2006.311036","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311036","url":null,"abstract":"This poster presented Rudder, an agent-based infrastructure for the dynamic composition of gid services. Rudder is based on an associative composition space abstraction, and supports dynamic workflow enactment using software agents. The agents semantically discover and select services required by the workflow, and compose the selected services. The agents manage the execution of the workflow at runtime, and adapt the workflow reactively. Prototypes of Rudder and the Comet substrate have been developed and deployed as Java services within the JXTA framework","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131554513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Snapshot Processing in Streaming Environments","authors":"D. M. Zimmerman, K. Chandy","doi":"10.1109/ICGRID.2006.311038","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311038","url":null,"abstract":"Computational issues related to streaming data, and in particular the monitoring and rapid correlation of multiple sources of streaming data, are becoming increasingly important in contexts ranging from business processes to crisis detection. For example, a government system to detect bioterror attacks must correlate multiple streams of possibly low-confidence data from sensors and local and national public health information networks with cues from indicators such as news and government sources indicating geographical locations, tactics and timing of possible attacks. The results of this correlation trigger appropriate responses, such as flagging information for more in-depth analysis or sending alerts to public health officials. Monitoring and correlation applications of this type are ideal for deployment on distributed computing grids, because they have high transaction throughput, require low latency, and can be partitioned into sets of small communicating computations with regular communication patterns. An important consideration in these applications is the need to ensure that, at any given time, computations are carried out on an accurate - or at least close to accurate - picture of the environment being monitored. One way of doing this, which we call snapshot processing, is to treat collections of events that occur at approximately the same time as representing a global snapshot - a valid state - of the environment. Computation on the resulting series of snapshots is much like computation on a real-time video of the entire environment. We briefly describe our model for these stream processing computations and introduce the concept of snapshot processing","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"23 20","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120929602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}