{"title":"The iDorm - A Practical Deployment of Grid Technology","authors":"Anthony Pounds-Cornish, Arran Holme","doi":"10.1109/CCGRID.2002.1017192","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017192","url":null,"abstract":"A purpose built environmental testbed for Intelligent Interactive Environments research, based upon student accommodation (iDorm) is described. It is argued to be a practical example of Grid technology. The testbed combines several different networks and provides a common protocol to act as a gateway between the different sensors and effectors in the iDorm. A variety of interfaces to allow users to control and monitor the different services are described and critiqued. Future plans for extensions to the iDorm are described along with future plans for research experiments using intelligent agents as monitoring tools and interfaces themselves.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133993832","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":"Negotiating Agents in a Market-Oriented Grid","authors":"K. Chao, R. Anane, Jen-Hsiang Chen, R. Gatward","doi":"10.1109/CCGRID.2002.1017183","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017183","url":null,"abstract":"The leasing of idle computing resources over the net is one way to motivate more participants to join the grid computation initiative. Since the participating parties are independent bodies, negotiation activities are required. In this research, we propose a new automated negotiation mechanism that allows each party to reach an agreement. The mechanism includes two methods: a co-evolutionary method and a game theory based method that is a trusted third party mediated game to facilitate the automation of negotiation between two participants. This mechanism allows them to reach a state that exhibits Pareto efficiency and Nash Equilibrium without knowing each other's utility function.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132095754","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}
Carsten Ernemann, Volker Hamscher, U. Schwiegelshohn, R. Yahyapour, A. Streit
{"title":"On Advantages of Grid Computing for Parallel Job Scheduling","authors":"Carsten Ernemann, Volker Hamscher, U. Schwiegelshohn, R. Yahyapour, A. Streit","doi":"10.1109/CCGRID.2002.1017110","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017110","url":null,"abstract":"This paper addresses the potential benefit of sharing jobs between independent sites in a grid computing environment. Also the aspect of parallel multi-site job execution on different sites is discussed. To this end, various scheduling algorithms have been simulated for several machine configurations with different workloads which have been derived from real traces. The results showed that a significant improvement in terms of a smaller average response time is achievable. The usage of multi-site applications can additionally improve the results as long as the increase of the execution time due to communication overhead is limited to about 25%.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114844844","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":"Overcoming the Problems Associated with the Existence of Too Many DSM APIs","authors":"M. Schulz","doi":"10.1109/CCGRID.2002.1017153","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017153","url":null,"abstract":"Despite the large research efforts in the SW-DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons contributing to this is the existence of a large variety of different, incompatible systems and APIs, which severely restricts portability. This work therefore proposes a DSM framework, called HAMSTER, which allows the low complex implementation of basically arbitrary DSM APIs on top of a single core and thereby enables the easy retargeting of the system to specific application needs. This flexibility is achieved by offering a comprehensive set of shared memory services grouped into orthogonal modules. Combined, they offer a comprehensive interface capable of supporting the different requirements of the various DSM APIs.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114325130","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":"A Formal Framework for Defining Grid Systems","authors":"Z. Németh, V. Sunderam","doi":"10.1109/CCGRID.2002.1017128","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017128","url":null,"abstract":"Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary functionalities of grid systems. A comparative analysis with conventional distributed systems shows that there are semantical differences, not just technical ones. The resulting abstract working model for grids can serve as a framework for defining new systems or analyzing existing ones.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133962220","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":"LDAP and the Grid","authors":"Peter Gietz","doi":"10.1109/CCGRID.2002.1017099","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017099","url":null,"abstract":"LDAP (Lightweight Directory Access Protocol) has increasingly gained importance also as database technology for storing network resource management information, which is a necessity in Grid and Cluster Computing, The tutorial will give a detailed introduction in the underlying X.500 Data model and the LDAPv3 operational model. It will give an update on the standardization activities and an overview of the application fields. The last part will deal with the use of LDAP in Grid computing, which includes an overview of the Globus toolkit, and the use of LDAP in different Global Grid Forum working groups.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125523566","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":"The Cluster File System: Integration of High Performance Communication and I/O in Clusters","authors":"R. Cristaldi, G. Iannello, F. Delfino","doi":"10.1109/CCGRID.2002.1017125","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017125","url":null,"abstract":"In this paper, we report on the experiences in designing a portable parallel file system for clusters. The file system offers to the applications an interface compliant with MPI-IO, the I/O interface of the MPI-2 standard. The file system implementation relies upon MPI for internal coordination and communication. This guarantees high performance and portability over a wide range of hardware and software cluster platforms. The internal architecture of the file system has been designed to allow rapid prototyping and experimentation of novel strategies for managing parallel I/O in a cluster environment. The discussion of the file system design and early implementation is completed with basic performance measures confirming the potential of the approach.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378739","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":"The gSOAP Toolkit for Web Services and Peer-to-Peer Computing Networks","authors":"R. Engelen, K. Gallivan","doi":"10.1109/CCGRID.2002.1017120","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017120","url":null,"abstract":"This paper presents the gSOAP stub and skeleton compiler. The compiler provides a unique SOAP-to-C/C++ language binding for deploying C/C++ applications in SOAP Web Services, clients, and peer-to-peer computing networks. gSOAP enables the integratation of (legacy) C/C++/Fortran codes, embedded systems, and real-time software in Web Services, clients, and peers that share computational resources and information with other SOAP-enabled applications, possibly across different platforms, language environments, and disparate organizations located behind firewalls. Results on interoperability, legacy code integration, scalability, and performance are given.","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129082455","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":"The Virtual Laboratory: A Toolset for Utilising the World-Wide Grid to Design Drugs","authors":"R. Buyya, K. Branson, J. Giddy, D. Abramson","doi":"10.1109/CCGRID.2002.1017142","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017142","url":null,"abstract":"","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"59 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127614564","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":"Load Balancing by Remote Execution of Short Processes on Linux Clusters","authors":"M. Kacer, P. Tvrdík","doi":"10.1109/CCGRID.2002.1017141","DOIUrl":"https://doi.org/10.1109/CCGRID.2002.1017141","url":null,"abstract":"PC clusters typically operate under continuously changing conditions and load balancing is critically important for efficient utilization of their resources, for maximizing their performance, and for minimizing the process response times. The average process response time is usually considered the most important value for measuring the actual performance of a multitasking system. Clearly, load balancing is critical for clusters running long-term processes (run times of hours). The main motivation of this paper is to study the suitability of the load balancing of short-term CPU-intensive processes, e.g., compilers, compression utilities, etc. Such processes represent a large part of a typical workload of a Linux workstation and load balancing can improve the process response time considerably in such cases. This topic appears to be neglected in the literature. The load balancing can be implemented by process migration (when a running process is stopped, checkpointed, checkpoint data are transferred to another node, and the process is restarted there) or by remote execution (when a process is transferred to another node when it is started and has no allocated memory). While the former solution is more universal (the process can be transferred in any moment), the latter one causes less overhead, which is very important especially when short processes are considered. A load-balancing algorithm is composed of three basic parts: a transferring mechanism, which implements remote execution or process migration, a load-balancing strategy, which makes decisions which process is to be moved where, and an information policy, which collects the information about the cluster state and distributes it among all the nodes. In Linux, a new process is created by fork system call, which makes an exact copy of the parent process, includ-","PeriodicalId":160584,"journal":{"name":"2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02)","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711462","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}