I. Alshabani, R. Olejnik, B. Toursel, M. Tudruj, E. Laskowski
We propose a new component framework over a middleware platform for grid computing: DG-ADAJ (desktop grid-adaptive distributed application in Java). Our platform allows having a single system image (SSI) of the grid platform. It gives a special mechanism at middleware level which assures dynamic and automatic adaptation to variations of computation methods and execution platform. DG-ADAJ gives also specific mechanisms based on control components which helps a users to build component-based parallel/distributed applications. We use the CCA (common component architecture) as a component architecture model for our framework. CCADAJ (CCA-ADAJ) is a layer above the DG-ADAJ environment, which helps user to build his parallel/distributed applications by assembling components in a transparent way and which exploits the parallelism of the environment
{"title":"A Framework for Desktop GRID Applications: CCADAJ","authors":"I. Alshabani, R. Olejnik, B. Toursel, M. Tudruj, E. Laskowski","doi":"10.1109/ISPDC.2006.2","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.2","url":null,"abstract":"We propose a new component framework over a middleware platform for grid computing: DG-ADAJ (desktop grid-adaptive distributed application in Java). Our platform allows having a single system image (SSI) of the grid platform. It gives a special mechanism at middleware level which assures dynamic and automatic adaptation to variations of computation methods and execution platform. DG-ADAJ gives also specific mechanisms based on control components which helps a users to build component-based parallel/distributed applications. We use the CCA (common component architecture) as a component architecture model for our framework. CCADAJ (CCA-ADAJ) is a layer above the DG-ADAJ environment, which helps user to build his parallel/distributed applications by assembling components in a transparent way and which exploits the parallelism of the environment","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133009844","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}
In many parallel and distributed applications broadcasting represents a natural way of communication between processes/objects/actors. In addition mobility is often mandatory, as for instance, for the development of ad-hoc networks applications. The fusion of these two concepts into one unique and coherent model of concurrency represents a great interest for the development of such classes of applications together with appropriate programming models and languages. An original model that combines mobility and selective broadcasting has been developed by Ene and Muntean: the bpi-calculus. The "mobile ambients" by Gordon and Cardelli, represents also, among others, an interesting framework for mobility and ubiquity of applications. The goal of this paper is to propose a model for broadcasting secure systems that we consider to be more appropriate for ad-hoc networks and ubiquitous applications, reinforcing the mobility and security aspects
{"title":"Towards a Model for Broadcasting Secure Mobile Processes","authors":"Victor Moraru, T. Muntean, E. Guțuleac","doi":"10.1109/ISPDC.2006.52","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.52","url":null,"abstract":"In many parallel and distributed applications broadcasting represents a natural way of communication between processes/objects/actors. In addition mobility is often mandatory, as for instance, for the development of ad-hoc networks applications. The fusion of these two concepts into one unique and coherent model of concurrency represents a great interest for the development of such classes of applications together with appropriate programming models and languages. An original model that combines mobility and selective broadcasting has been developed by Ene and Muntean: the bpi-calculus. The \"mobile ambients\" by Gordon and Cardelli, represents also, among others, an interesting framework for mobility and ubiquity of applications. The goal of this paper is to propose a model for broadcasting secure systems that we consider to be more appropriate for ad-hoc networks and ubiquitous applications, reinforcing the mobility and security aspects","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114236917","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}
The novel parallel/distributed application control method, discussed in this paper, is based on the use of global states monitoring. Application processes report their local states to monitors. The monitors construct global states, analyze them and send control signals to processes to stimulate necessary actions. A number of application areas of this control method are examined. Tests results and gained experience are presented for irregular computation, load balancing and dynamic workflow implementations. It is shown, that the new control method can lead to a better performance than message passing and that it provides a useful and convenient framework, facilitating program development and maintenance
{"title":"Usage of Global States-Based Application Control","authors":"J. Borkowski, D. Kopanski, M. Tudruj","doi":"10.1109/ISPDC.2006.53","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.53","url":null,"abstract":"The novel parallel/distributed application control method, discussed in this paper, is based on the use of global states monitoring. Application processes report their local states to monitors. The monitors construct global states, analyze them and send control signals to processes to stimulate necessary actions. A number of application areas of this control method are examined. Tests results and gained experience are presented for irregular computation, load balancing and dynamic workflow implementations. It is shown, that the new control method can lead to a better performance than message passing and that it provides a useful and convenient framework, facilitating program development and maintenance","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114638219","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}
This paper discusses iterative algorithms for reconstruction of 2D images. The formulation of the distributed algorithm and its properties are described. The details of the distributed implementation of the ART (algebraic reconstruction technique) are presented. Parallel implementation in a parallel system based on dynamically configurable clusters is proposed
{"title":"Distributed Formulation of Artificial Reconstruction Technique with Reordering of Critical Data Sets","authors":"B. Butrylo, M. Tudruj, L. Masko","doi":"10.1109/ISPDC.2006.20","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.20","url":null,"abstract":"This paper discusses iterative algorithms for reconstruction of 2D images. The formulation of the distributed algorithm and its properties are described. The details of the distributed implementation of the ART (algebraic reconstruction technique) are presented. Parallel implementation in a parallel system based on dynamically configurable clusters is proposed","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127399847","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}
In this paper we introduce a two-phase dynamic load-balancing technique for P2P computing systems. The first phase consists of mapping a P2P network onto a hierarchical topology based on 1-D space tessellations. This hierarchy is called TreeP (tree based P2P architecture). The second phase consists of balancing the load among the peers using the PSLB (positional scan load-balancing) technique, which is well suited for regular topologies. We study this technique and optimize its implementation on the TreeP topology. This technique is simple, efficient, scalable, and does not introduce a considerable overhead as shown in the experimental results and theoretical study
{"title":"On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies","authors":"M. W. Akhtar, Mohand Tahar Kechadi","doi":"10.1109/ISPDC.2006.35","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.35","url":null,"abstract":"In this paper we introduce a two-phase dynamic load-balancing technique for P2P computing systems. The first phase consists of mapping a P2P network onto a hierarchical topology based on 1-D space tessellations. This hierarchy is called TreeP (tree based P2P architecture). The second phase consists of balancing the load among the peers using the PSLB (positional scan load-balancing) technique, which is well suited for regular topologies. We study this technique and optimize its implementation on the TreeP topology. This technique is simple, efficient, scalable, and does not introduce a considerable overhead as shown in the experimental results and theoretical study","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117202265","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}
Rocco Aversa, B. D. Martino, N. Mazzocca, S. Venticinque
The integration of Web services and software agents brings new opportunities and helps in defining new kinds of services too. A very interesting approach comes from the adoption of "mobile agents" to design and develop a service oriented architecture that supports the access to distributed services by heterogeneous handheld devices. This paper describes the functional model and the architecture design of a platform for services composition and delivery. Mobile agents are able to access and compose services accessing them by standard interfaces. User authentication, service discovery and publication, personalization are other provided facilities. Technological interoperability is provided by Web services technology. Code mobility is exploited to reconfigure the server platform moving agents to the available nodes, or to reconfigure the user devices providing it with the needed client software
{"title":"Web Services Composition and Delivery Using a Mobile Agents Based Infrastructure","authors":"Rocco Aversa, B. D. Martino, N. Mazzocca, S. Venticinque","doi":"10.1109/ISPDC.2006.56","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.56","url":null,"abstract":"The integration of Web services and software agents brings new opportunities and helps in defining new kinds of services too. A very interesting approach comes from the adoption of \"mobile agents\" to design and develop a service oriented architecture that supports the access to distributed services by heterogeneous handheld devices. This paper describes the functional model and the architecture design of a platform for services composition and delivery. Mobile agents are able to access and compose services accessing them by standard interfaces. User authentication, service discovery and publication, personalization are other provided facilities. Technological interoperability is provided by Web services technology. Code mobility is exploited to reconfigure the server platform moving agents to the available nodes, or to reconfigure the user devices providing it with the needed client software","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122532662","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}
In this paper we present the design and implementation of a multiagent framework for executing multiple concurrent jobs in a grid environment. Resource broker plays an imperative role in our framework. The aim of the resource broker is to find, select, reserve and allocate suitable resources to each job submitted by the client. Resource broker always tries to optimize resource utilization and ensure fairness. The multiagent framework assists in executing multiple concurrent jobs in an adaptive execution environment. Services offered by the framework include resource brokering, performance analysis, local tuning and more importantly rescheduling depending on the changing resource requirements. Part of the framework makes use of mobile agents for scheduling and rescheduling purposes. The paper discusses the implementation of the resource brokering and also describes the implementation of a part of the framework which schedules and reschedules the jobs and manages the resources on the basis of some performance monitoring data
{"title":"A Multi-agent Framework for Resource Brokering of Multiple Concurrent Jobs in Grid Environment","authors":"Sarbani Roy, S. Dasgupta, N. Mukherjee","doi":"10.1109/ISPDC.2006.3","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.3","url":null,"abstract":"In this paper we present the design and implementation of a multiagent framework for executing multiple concurrent jobs in a grid environment. Resource broker plays an imperative role in our framework. The aim of the resource broker is to find, select, reserve and allocate suitable resources to each job submitted by the client. Resource broker always tries to optimize resource utilization and ensure fairness. The multiagent framework assists in executing multiple concurrent jobs in an adaptive execution environment. Services offered by the framework include resource brokering, performance analysis, local tuning and more importantly rescheduling depending on the changing resource requirements. Part of the framework makes use of mobile agents for scheduling and rescheduling purposes. The paper discusses the implementation of the resource brokering and also describes the implementation of a part of the framework which schedules and reschedules the jobs and manages the resources on the basis of some performance monitoring data","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116034606","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}
The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications
{"title":"Parallel and Distributed Computing with Java","authors":"M. Baker, M. Grove, A. Shafi","doi":"10.1109/ISPDC.2006.38","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.38","url":null,"abstract":"The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133041066","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}
The resource discovery problem, where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin (1999) in the context of Akamai Technologies with the goal of building an Internet-wide content-distribution system. In the solutions for the synchronous setting proposed so far in the papers by Harchol-Bartel et al. (1999), Kutten et al. (2001) and Law and Siu (2000), there is a possibility that during some time step many machines may contact a single machine, and this is not a realistic assumption. This work assumes a synchronous model, however at each step a machine can send and receive only a constant number of messages. It is shown that the conjectured poly-logarithmic upper bound (Harchol-Bartel et al., 1999) for such a setting is not possible. This is done by proving a lower bound on time of Omega(n), where n is the number of participating nodes. For this model a randomized algorithm is presented that solves the resource discovery problem in O(n log2 n) time, i.e., within a poly-logarithmic factor of the corresponding lower bound. The algorithm has a O(n2 log2 n) message complexity and O(n3 log3 n) communication complexity. Simulation results for the algorithm illustrate the lower and upper bounds, and lead to interesting observations
{"title":"Resource Discovery in Networks under Bandwidth Limitations","authors":"K. Konwar, Alexander A. Shvartsman","doi":"10.1109/ISPDC.2006.40","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.40","url":null,"abstract":"The resource discovery problem, where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin (1999) in the context of Akamai Technologies with the goal of building an Internet-wide content-distribution system. In the solutions for the synchronous setting proposed so far in the papers by Harchol-Bartel et al. (1999), Kutten et al. (2001) and Law and Siu (2000), there is a possibility that during some time step many machines may contact a single machine, and this is not a realistic assumption. This work assumes a synchronous model, however at each step a machine can send and receive only a constant number of messages. It is shown that the conjectured poly-logarithmic upper bound (Harchol-Bartel et al., 1999) for such a setting is not possible. This is done by proving a lower bound on time of Omega(n), where n is the number of participating nodes. For this model a randomized algorithm is presented that solves the resource discovery problem in O(n log2 n) time, i.e., within a poly-logarithmic factor of the corresponding lower bound. The algorithm has a O(n2 log2 n) message complexity and O(n3 log3 n) communication complexity. Simulation results for the algorithm illustrate the lower and upper bounds, and lead to interesting observations","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123608733","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}
Cristian Tapus, David A. Noblet, V. Grama, J. Hickey
This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability and fault tolerance. We employ a hybrid hash-based and tree-based lookup mechanism for files that, combined with an efficient caching scheme, provides fast access to files in the system. MojaveFS uses a novel data storage strategy where files are split into smaller objects to increase data availability. It also uses a group communication protocol with guarantees for a total order on messages sent within the system, enabling MojaveFS to support the traditional sequential consistency model for concurrent access
{"title":"MojaveFS: Providing Sequential Consistency in a Distributed Objects System","authors":"Cristian Tapus, David A. Noblet, V. Grama, J. Hickey","doi":"10.1109/ISPDC.2006.34","DOIUrl":"https://doi.org/10.1109/ISPDC.2006.34","url":null,"abstract":"This paper presents MojaveFS, a distributed file system with support for sequential consistency. It provides location transparency and makes use of replication for reliability and fault tolerance. We employ a hybrid hash-based and tree-based lookup mechanism for files that, combined with an efficient caching scheme, provides fast access to files in the system. MojaveFS uses a novel data storage strategy where files are split into smaller objects to increase data availability. It also uses a group communication protocol with guarantees for a total order on messages sent within the system, enabling MojaveFS to support the traditional sequential consistency model for concurrent access","PeriodicalId":196790,"journal":{"name":"2006 Fifth International Symposium on Parallel and Distributed Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760864","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：