Grid computing on mobile phones

is a highly experienced Principal Architect at UnitedHealth Group, where he leads the design and implementation of advanced network, security, and cloud solutions for large-scale enterprises. With more than 15 years of experience in IT, Saurabh has built an outstanding reputation for creating secure, scalable, and reliable technology systems that meet the complex needs of modern businesses.

Grid computing enlarge with computing platform which is collection of heterogeneous computing resources connected by a network across dynamic and geographically dispersed organization to form a distributed high performance computing infrastructure. Grid computing solves the complex computing problems amongst multiple machines. Grid computing solves the large scale computational demands in a high performance computing environment. The main emphasis in the grid computing is given to the resource management and the job scheduler .The goal of the job scheduler is to maximize the resource utilization and minimize the processing time of the jobs. Existing approaches of Grid scheduling doesn't give much emphasis on the performance of a Grid scheduler in processing time parameter. Schedulers allocate resources to the jobs to be executed using the First come First serve algorithm. In this paper, we have provided an optimize algorithm to queue of the scheduler using various scheduling methods like Shortest Job First, First in First out, Round robin. The job scheduling system is responsible to select best suitable machines in a grid for user jobs. The management and scheduling system generates job schedules for each machine in the grid by taking static restrictions and dynamic parameters of jobs and machines into consideration. The main purpose of this paper is to develop an efficient job scheduling algorithm to maximize the resource utilization and minimize processing time of the jobs. Queues can be optimized by using various scheduling algorithms depending upon the performance criteria to be improved e.g. response time, throughput. The work has been done in MATLAB using the parallel computing toolbox.

The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach for grid users. We also show, a GPC-AKA security protocol proof using formal automated security analysis Sycther tool.

14th International Conference on Advances in Computing and Information Technology (ACITY 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computing and Information Technology. The conference focuses on all technical and practical aspects of high performance computing, green computing, pervasive computing, cloud computing etc.

We considered building high performance tools on the Raspberry Pi 4. We implemented OpenMP and OpenCoarrays Fortran in conjunction with the statistical language R. We found that the OpenCoarrays is more effective when working with vectors, while OpenMP is better in the arena with large matrices in a geostatistics application. These results can be very useful for researchers with limited access to high performance tools or limited funding.

Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-theart technique for wireless multimedia applications, such as entertainments and disaster recovery. The peers share the live streaming over MANET via multi-hop wireless link, so an efficient data delivery scheme must be required. However, the high churn rate and the frequent mobility baffle the P2P membership management and overlay maintenance. The unreliable wireless connection of MANET leads to the difficulties of large-scale and real-time streaming distribution, and a lack of overlay proximity leads to the inefficient streaming delivery. We present a cross-layer design for P2P over MANET to manage and maintain the overlay, and select efficient routing path to multicast media streams. Our proposed scheme (COME-P2P) integrates both P2P DHT-based lookup and IPv6 routing header to improve the delivery efficiency. Through the cross-layer design, the low layer detects mobility for informing high layer to refine the finger table, and high layer maintains the efficient multicast path for informing low layer to refine the routing table. How to keep stable routing paths for live streaming via IPv6 routing is the main contribution of this paper. The overlay proximity can shorten routing propagation delay, and the hop-by-hop routing can avoid the traffic bottleneck. Through the mathematical analysis and simulation results, COME-P2P can be demonstrated to achieve high smoothness and reduce signaling overhead for live streaming.

With the widespread availability of smartphones and advancement in communication technologies, Dew Computing paradigm(DCp) has emerged as a state-of-the-art computing paradigm. DCp provides an ecosystem to execute computationally intensive tasks which comprise of several subtasks. Each subtask is allocated for execution to an available and capable mobile device by taking into consideration its features like mobility, processing power, remaining battery, etc. This kind of "on-the-spot" paradigm comprises of mobile devices only which are part of mobile grid and it doesn't use the fixed infrastructure based computing systems for computational purposes. Being resource constrained, such a paradigm needs an efficient scheme for allocation of resources. Here we propose a scheme called MGRA for allocation of computing nodes which takes into account challenging issues like mobility of users, inefficient resource allocation and handling of failure situations. Experimentation was carried out using a DCp testbed comprising Android devices connected with Wi-Fi Direct protocol. MGRA exhibited significant improvement in terms of time for application completion, amount of battery usage and time required for recovering from failure as compared to present-day approaches.

With the widespread availability of smartphones and advancement in communication technologies, Dew Computing paradigm(DCp) has emerged as a state-of-the-art computing paradigm. DCp provides an ecosystem to execute computationally intensive tasks which comprise of several subtasks. Each subtask is allocated for execution to an available and capable mobile device by taking into consideration its features like mobility, processing power, remaining battery, etc. This kind of “on-the-spot” paradigm comprises of mobile devices only which are part of mobile grid and it doesn’t use the fixed infrastructure based computing systems for computational purposes. Being resource constrained, such a paradigm needs an efficient scheme for allocation of resources. Here we propose a scheme called MGRA for allocation of computing nodes which takes into account challenging issues like mobility of users, inefficient resource allocation and handling of failure situations. Experimentation was carried out u...

In economic Grid environments, the producers (resource owners) and consumers (resource users) have different goals, objectives, strategies, and supply-and-demand patterns. Mechanism based on economic models is an effective approach to solve the problem of grid resources management. Grid resource valuation and allocation is one of the fundamental problems in grid resource management. The essence of this problem is how to allocate and valuation resources for achieving the goal of a highly efficient utilization of resources in response to current resource valuations. Pricing policies are based on the demand from the users and the supply of resources is the main driver in the competitive, economic market model. In this paper, we present a new method of resource allocation and valuation based on the learning automata algorithms in order to maximize the benefit for both grid providers and grid users. We formulate the problem as an environment that learning automata's allocate best resource based on its complete time for proffered application. After allocate of resource, valuation of it based on its complete time is done. With this method the valuation of resource is based on their suitability for jobs execution. Using computer simulations, it is shown that the proposed methodology have higher performance in comparing with existing methods.

This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure. In this paper, we propose a two-phase resource allocation scheme to reduce communication cost between dependent tasks. The scheme is divided into two phases. The first phase exploits the history of user mobility patterns to select nodes that provide long-term connectivity and the second phase takes into account the task and dependency types, and uses the distance information among the nodes selected in the first phase to reduce communication costs. The scheme is validated in a simulation environment using various workloads and parameters.

Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.

I finish my thesis with small anecdotes in my acknowledgement section. Many friends and colleagues have contributed to my success, and I want to thank them all here. First, I would like to thank my director of studies Prof. Richard McClatchey for his full support, expert guidance, wise counsel and understanding throughout my study, and for the generous funding which enabled me to travel, discuss and share my work with experts all around the world. I am fortunate enough to work with such a wonderful supervisor who is not only an excellent academic mentor but he developed my personality in a number of ways through his utmost patience, healthy criticism, vivid encouragement and occasionally refreshments. Second, I am deeply indebted to my supervisor at CERN Prof. Ian Willers for his time, support and professional assistance in the development and completion of this research, and the European Centre for Nuclear Research for giving me an opportunity to be part of an exceptional research environment. Third, I highly acknowledge the marvelous support, encouragement and counseling from Prof. Arshad Ali who is also my third supervisor. He always supported me financially, morally, technically and even psychologically when I used to be in trouble, always helped like an elder brother and father. He introduced me to the deep sea of research and I can still remember the midnight video conferences with Caltech to sort out the research related issues in the early days of my research in 2002. I should thank Heinz Stockinger from the Swiss Institute of Bioinformatics for his very apt technical assistance, friendly guidance and useful discussions throughout the course of this research. He is a wonderful friend who helped me a number of times, in a number of ways and facilitated my research in the best possible way. His valuable technical input and review on papers always provided very helpful insight. There are many other important contributions from a number of important people which need due acclamation. Dr. Julian Bunn from CACR and Prof. Harvey Newman from Caltech deserve my special thanks for their technical input, supervision, guidance and support. I am very thankful to Michael Thomas, Conrad Steernberg and Frank Van Lingen from the Caltech team for their technical discussion on many issues and support during the work on the Clarens framework. Michael helped a lot to make JClarens a reality and extended his support during the work on the Data Location Service. I should also thank to Iosif Legrand from Caltech for his assistance on MonaLISA and MONARC related issues. At the same time I should be grateful to Les Cottrell from SLAC for providing valuable insight in the use of the PingER performance monitoring tool for Grid Scheduling. I should be thankful to Lucas Taylor, Laasi Turra and Shahzad Muzaffar from North Eastern American University for the review of my proposals, reports and papers and then providing their valuable comments to use them in the CERN environment and Tony Johnson from SLAC for helping to port the JAS software. I should also thank to

For the execution of the scientific applications, different methods have been proposed to dynamically provide execution environments for such applications that hide the complexity of underlying distributed and heterogeneous infrastructures. Recently virtualization has emerged as a promising technology to provide such environments. Virtualization is a technology that abstracts away the details of physical hardware and provides virtualized resources for high-level scientific applications. Virtualization offers a cost-effective

India is an agriculture based developing country. Information dissemination to the knowledge intensive agriculture sector is upgraded by mobile-enabled information services and rapid growth of mobile telephony. It bridge the gap between the availability of agricultural input and delivery of agricultural outputs and agriculture infrastructure. Mobile computing, cloud computing, machine learning and soft computing are the immerging techniques which are being used in almost all fields of research. Apart from this, they are also useful in our day-today activities such as education, medical and agriculture. This paper explores how Android Apps of agricultural services have impacted the farmers in their farming activities.

The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach for grid users. We also show, a GPC-AKA security protocol proof using formal automated security analysis Sycther tool.

This paper proposes a novel Quality of experience based Energy Efficient method (QEE) to distribute Peer-to-Peer (P2P) video in a mobile ad hoc network. P2P video distribution is first formulated as a resource allocation problem with the aim of maximizing the end user's quality of experience. We studied the resource allocation problem as a linear optimization problem to provide efficient utilization of upload bandwidth and energy at each mobile node. Furthermore, scalable video coding is used, that helps maximizing the quality of experience by distributing the layered video over multiple sources using multiple paths to minimize the power consumption and the upload bandwidth at each node. The simulation results show that in the case of 10% uploader nodes in the network, and at the nodes velocity of 1 m/s; QEE method consumes 5 to 25% less power, as compared to existing methods such as; EVAN (Energy aware video streaming in wireless ad hoc network), WCNC (Assessing best strategy for adaptive streaming in mobile ad hoc network), QNE (QoE based non Energy Efficient) and NQNE (Non QoE based Non Energy Efficient). This is because the load is efficiently distributed across multiple sources in the network. Furthermore, the result also shows that for the case of 10% uploader nodes in the network QEE method achieves 10% higher Mean Opinion Score (MOS) among nodes as compared to EVAN and QNE methods as it considers path utility for streaming the video using multiple sources over multiple paths. We have also evaluated the performance of QEE under network churn and flash crown scenarios; the result shows that QEE maintains a reasonable quality under such situations.

This paper focuses on automatic mechanisms for task distribution and execution in virtual and mobile environments. In particular, the goal is the implementation of Utility Computing services that enable users to submit their source code and to have their applications executed without concerning about resource allocation, task distribution, and load-balancing. The proposed solution consists in a distributed agent-based software infrastructure that grants a high level of transparency from the user point of view. As a matter of fact, accordingly with the Utility Computing model, the user has just to submit its tasks and their input parameters; after that, the software infrastructure takes care of (1) encapsulating tasks in mobile agents; (2) distributing them in the virtual environment; (3) launching and controlling execution; (4) picking up results; and (5) handling computing stations. Finally, it is important to note that the infrastructure is able to integrate both fixed and mobile hardware resources to build a community of computing stations for task executions. As a consequence, such an infrastructure can get useful computing power even from stations (mobile devices) that have always been neglected by classic task execution platforms.

Grid computing is utilized in variety of computational areas now-a-days. It is the next generation of distributed computing. In grid computing, we try to integrate many heterogonous, geographically distributed computing systems into one. All the systems in the grid are linked together to provide better resources. Hence, we can use resources of any system, which is in grid, for our task. This paper presents a job scheduling algorithm that can utilize the resources in efficient way.

Distributed Systems (DS) are the systems in which the components are distributed at different locations in a network and these components interact with each other by passing messages. In DS each system has a memory and a processor pair. DS is cost-effective, more reliable and faster when compared to the conventional computer systems. But there are some issues in the allocation of resources in such systems as the resources are shared over a number of systems apart from its own individual tasks. The current literature developed various techniques to allocate the resources efficiently by using basic algorithms based on local and global messages and tradeoffs. However, these methods may not be effective as they require special storage and maintenance and constraints the resource availability. In this paper, an efficient resource allocation technique is developed using prioritization and class-based algorithm. The tasks are first given priority and then resources are allocated by fixing ...

Grid computing systems are complex and dynamic environments requiring appropriate automated management mechanisms, which would enable stable and reliable operation of the whole grid ecosystem. Moreover, the recent novel concept of mobile grid computing – a combination of grid systems with mobile devices – also requires new ways of monitoring the emerging security aspects, associated with the everincreasing role of network connections in mobile grids. Existing grid monitoring systems, albeit suitable for traditional, localised grid systems, seem to be ignoring the security dimension and do not offer appropriate support for enforcing security policies within a distributed grid system enhanced with mobile devices. Accordingly, in this paper we present the Grid Security Policy Monitoring System (GridSPMS) – a novel grid monitoring framework, which extends the traditional support for data monitoring (i.e., tools, protocols, etc.) with mechanisms for collecting run-time data within grids,...

Grid computing systems are complex and dynamic systems and therefore require appropriate automated management, which would enable stable and reliable operation of the whole grid environment. The research community has addressed this requirement with a number of monitoring frameworks, which serve to collect data at various levels to support decision taking and management activities within grids. However, these existing solutions seem to implement little support for collecting security-related data and enforcing appropriate security policies and constraints in this respect. With an increasing role of network connections and users remotely accessing computational resources from various locations, grid systems are no longer seen as localised and isolated ecosystems, but are coming to be more open and distributed. In this light, it is becoming more and more important to enable monitoring framework with capabilities to collect security-related data and check whether these observations comply with certain security constraints. Accordingly, this paper presents a survey of existing grid monitoring systems with a goal to identify an existing gap of insufficient support for handling the security dimension in grids. The survey suggests that available grid monitoring frameworks are incapable of collecting security-related data metrics and evaluating them against a set of security policies. As a first step towards addressing this issue, the paper outlines several groups of security policies, which the authors expect to be further incorporated in their own research work, and by the wider community.

The resource allocation in Grid computing system needs to be scalable, reliable and smart. It should also be adaptable to change its allocation mechanism depending upon the environment and user's requirements. Therefore, a scalable and optimized approach for resource allocation where the system can adapt itself to the changing environment and the fluctuating resources is essentially needed. In this paper, a Teaching Learning based optimization approach for resource allocation in Computational Grids is proposed. The proposed algorithm is found to outperform the existing ones in terms of execution time and cost. The algorithm is simulated using GRIDSIM and the simulation results are presented.

The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach for grid users. We also show, a GPC-AKA security protocol proof using formal automated security analysis Sycther tool.

In recent years, the proliferation of mobile devices has led to the emergence of mobile grid computing, that is extending the reach of grid computing by enabling mobile devices both to contribute to and utilise grid resources. Thus, the pool of available computational and storage resources can be significantly enriched by leveraging idle capacities of mobile devices. Nevertheless, the emergence of the mobile grid gives rise to challenges, which have not hitherto been addressed thoroughly. Among those is the security threat, which arises from the multitude of mobile devices accessing grid resources and associated network connections, spanning across the globe. Accordingly, the aim of this paper is twofold. First, it surveys prominent grid monitoring systems and attempts to identify any potential limitations with respect to the security aspect. The results of the survey indicate that existing solutions fail to address the security concerns, which arises from enabling the mobile devices interacting with the grid. To this end the second aim of the paper is to propose a monitoring system which continuously tracks the geo-location of the mobile devices accessing the grid and thereby ascertains that the location-based security policies are not violated.

The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless, certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the demands of grid computing. Security and efficiency are the main objectives of grid authentication protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key management approach for grid users. We also show, a GPC-AKA security protocol proof using formal automated security analysis Sycther tool.

We address the problem of deciding when to spin down the disk of a mobile computer in order to extend battery life. Since one of the most critical resources in mobile computing environments is battery life, good energy conservation methods can dramatically increase the utility of mobile systems. We use a simple and efficient algorithm based on machine learning techniques that has excellent performance in practice. Our experimental results are based on traces collected from HP C2474s disks. Using this data, the algorithm outperforms several algorithms that are theoretically optimal in under various worst-case assumptions, as well as the best fixed time-out strategy. In particular, the algorithm reduces the power consumption of the disk to about half (depending on the disk's properties) of the energy consumed by a one minute fixed time-out. Since the algorithm adapts to usage patterns, it uses as little as 88% of the energy consumed by the best fixed time-out computed in retrospect.

Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks. In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters.

Human society is a complex and most organized networks, in which many communities have different cultural livelihood. The creation/formation of one or more communities within a society and the way of associations can be mapped to MANET. By involving human characteristics and behavior, surely it would pave a new way, for further development. In this paper we have presented a new approach called "HAMANET" which is not only robust and secure but it certainly meets the challenges of MANET (such as name resolution, address allocation and authentication). Our object oriented design defines a service in terms of Arts, Culture, and Machine. The 'Art' is the smallest unit of work (defined as an interface), the 'Culture' is the integration/assembling of one or more Arts (defined as a class) and finally the 'Machine' which is an instance of a Culture that defines a service. The grouping of the communicable Machines of the same Culture forms a 'Community'. We have used the term 'Society' for MANET consisting of one or more communities and modeled using humanistic approach. We have compared our design with GloMoSim and proposed the implementation of file transfer service using the said approach. Our approach gives better results in terms of implementation of the basic services, security, reliability, throughput, extensibility, scalability etc.

Agile software process presents an iterative and incremental approach to computer systems development, which focuses on user's needs and embraces changes. Virtual Reality projects are characterized by the rapid evolution of technology and by the need for clients' feedback, during the whole project's lifecycle. In this work, a comparative evaluation of existent methodologies is presented and the application of agile software development process in Virtual Reality projects is argued. Then, a proposal for an agile software development process for Virtual Reality systems is presented and its benefits are discussed.

With the widespread availability of smartphones and advancement in communication technologies, Dew Computing paradigm(DCp) has emerged as a state-of-the-art computing paradigm. DCp provides an ecosystem to execute computationally intensive tasks which comprise of several subtasks. Each subtask is allocated for execution to an available and capable mobile device by taking into consideration its features like mobility, processing power, remaining battery, etc. This kind of “on-the-spot” paradigm comprises of mobile devices only which are part of mobile grid and it doesn’t use the fixed infrastructure based computing systems for computational purposes. Being resource constrained, such a paradigm needs an efficient scheme for allocation of resources. Here we propose a scheme called MGRA for allocation of computing nodes which takes into account challenging issues like mobility of users, inefficient resource allocation and handling of failure situations. Experimentation was carried out u...

Grid and peer-to-peer (P2P) networks are two ideal technologies for file sharing. A P2P grid is a special case of grid networks in which P2P communications are used for communication between nodes and trust management. Use of this technology allows creation of a network with greater distribution and scalability. Semantic grids have appeared as an expansion of grid networks in which rich resource metadata are revealed and clearly handled. In a semantic P2P grid, nodes are clustered into different groups based on the semantic similarities between their services. This paper proposes a reputation model for trust management in a semantic P2P Grid. We use fuzzy theory, in a trust overlay network named FR TRUST that models the network structure and the storage of reputation information. In fact we present a reputation collection and computation system for semantic P2P Grids. The system uses fuzzy theory to compute a peer trust level, which can be either: Low, Medium, or High. Our experimen...

We considered building high performance tools on the Raspberry Pi 4. We implemented OpenMP and OpenCoarrays Fortran in conjunction with the statistical language R. We found that the OpenCoarrays is more effective when working with vectors, while OpenMP is better in the arena with large matrices in a geostatistics application. These results can be very useful for researchers with limited access to high performance tools or limited funding.

The objective of grid computing is to distribute the jobs to heterogeneous environment and increase the speed of processing the jobs. Most of the Grid tool kits use the First Come First Served (FCFS) based scheduling algorithm to distribute the job to different executors or client nodes. In FCFS scheduling algorithm, doesn't consider the capabilities of executors or client and also many processes runs on a processor, has bottlenecks in Grid environment such as when scheduling workloads that are subject to time constraints, it increases the waiting time of list of processes. We proposed a new scheduling algorithm called Optimum Resource Constraint (ORC) Scheduling algorithm which includes the combination of both the Best fit allocation and Round Robin scheduling to allocate the jobs in queue pool. The algorithm was implemented in local and global grid schedulers. This improved the efficiency of load balancing and dynamicity capability of the Grid resources. We measured the performance of ORC algorithm on a Grid computing with maximum number of jobs and nodes.

This paper describes an architecture model for multiagent systems that was developed in the European project LEAP (Lightweight Extensible Agent Platform). Its main feature is a set of generic services that are implemented independently of the agents and can be installed into the agents by the application developer in a flexible way. Moreover, two applications using this architecture model are described that were also developed within the LEAP project. The application domain is the support of mobile, virtual teams for the German automobile club ADAC and for British Telecommunications.

In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in computation intensive situations data may be pulled to the jobs. This kind of scheduling, in which there ...

This paper presents a literature review on computational grids, analyzing their use by various organizations and companies. It aims to identify the main challenges found in their usage, its trends and application. This computing model, although not new, has a considerable amount of users that operate in several areas. As a model that allows the use of heterogeneous computing environments, computational grids have many issues to consider for their use. This decentralized processing also allows their use to be adapted and improved by newer technologies. The findings of this study may provide insights for researchers and users on architecture improvements and computational grids usage possibilities. I.INTRODUCTION The Internet growth, powerful computers availability, high-speed computer networks just as the low cost of components raw materials, is changing the way that scientists and engineers do computing and also the way society in general manages information and services [23]. In 90...

In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in computation intensive situations data may be pulled to the jobs. This kind of scheduling, in which there ...

Abstract: The aim of this deliverable is to document a preliminary evaluation of the MobileMAN solutions both from a technical and social standpoint. From the technical standpoint, we present the results obtained from an extensive experimental study performed by setting up a prototype of a multi-hop ad hoc network, and testing its performance on a small-scale ad hoc network (up to 12 nodes). From the social standpoint, we present the methods and tools to introduce the MobileMAN solutions to the users and to collect preliminary users ’ feedbacks about expectations and acceptance of this new networking paradigm. Project funded by the European Community under the “Information

ڀيا ٜٽ ۇٴا ٣ هبز٭ه ذيڅبٽ ڃ يٴٽاڈ٥ ،يزيبپؽ يبڅ ڃييگځا ڇ ذچع ڀيڂچپڅ ڇ بڅ ٿآ بڅ بث اه ُ هك يځاليٽ ُڇه ىا ڃكبٮزٍا هڈْاٴ ٿبزٍا ُ يٽ هاوٱ يٍهوث كهڈٽ لڅك . ڄاٴ ڃلّ ٗو٭ ڀيا ويصبر ذؾر بڅهبز٭ه ِيپ ٛوّ ڇ ي٥بپزعا يبڅ ٿاڇه دڇبٮر ڇ ذٍا يزفبڂّ يزيٖقّ ،يزفبڂّ يبڅ ڇ يكبٽ ( يكبٖزٱا ) ڄث ٜيؾٽ ڃاوپڅ ي٥بپزعا يبڅ ڇ داكبٲز٥ا ،ي٥بپزعا يبڅكبچځ يٴيجٱ ىا ُىها ىڇوث هك بڅ ٿآ بڅ ذٍا وصڈٽ . يٽ ڄغيزځ ڄٹبٲٽ ڀيا ٿڈچ ييبڅوي٪زٽ ڄاٴ كويگ " ٜياوّ ڇ ٻكوٽ دلاوٴْٽ ىا ٿبڂيپٝا ڇ يڅبگآ ڄ٦ٽبع يلڂٽىبيځ ڇ وٲ٭ " ، " وصڈٽ ڄث كبٲز٥ا ٴپاٴ ٿكڈث ٿاوگيك دلاوٴْٽ ٤٭ه هك بڅ " ڇ " ٻل٥ ة وگيك ڀييگيبع كڈعڇ ڃ كڈف ٴپاٴ يع ٿبيڈگقٍبپ " ، " ٻل٥ ڄث هڇبث ( ٿاڈر ) ٿبٽىبٍ يبڅ ٤٭ه ياوث يزيبپؽ هڈٽا هك ۇٴب٦٭ يزيبپؽ يلڂٽىبيځ " ڇ " يڂي٥ ٿاڈر ( يكبٖزٱا ) ٴپاٴ ياوث ٿبيڈگقٍبپ " ڀيڂچپڅ ڇ " ٻ ذي٦ٱڇ ڇ بڅ ذي٦ٙڇ ٬ٝاڈ٥ ڇ دبٍبَؽا ٳوؾٽ يبڅ " ڀيوزْيث

With the widespread availability of smartphones and advancement in communication technologies, Dew Computing paradigm(DCp) has emerged as a state-of-the-art computing paradigm. DCp provides an ecosystem to execute computationally intensive tasks which comprise of several subtasks. Each subtask is allocated for execution to an available and capable mobile device by taking into consideration its features like mobility, processing power, remaining battery, etc. This kind of “on-the-spot” paradigm comprises of mobile devices only which are part of mobile grid and it doesn’t use the fixed infrastructure based computing systems for computational purposes. Being resource constrained, such a paradigm needs an efficient scheme for allocation of resources. Here we propose a scheme called MGRA for allocation of computing nodes which takes into account challenging issues like mobility of users, inefficient resource allocation and handling of failure situations. Experimentation was carried out u...

Generally, in cloud computing the data is outsourced to controls of third party, which may lead to issue of securitys. The data in cloud may lost because of attacks by unknown users and nodes inside the cloud .Therefore, the data within in the cloud must be kept in secured state by using different techniques .In this paper, we propose division and replication of data within in the cloud to improve optimal performance and security .In the present work we separate a file into multiple fragment sand replicate fragments on different nodes in the cloud. Each node, should store fragment only once. Therefore, no information can be get by the attacker. The node storing the fragments within the cloud are separated using a method called T-colouring, which avoids the attacker to find the location of nodes that contain related fragments. The traditional cryptographic techniques for data security are not used in this work, so that computationally expensive methodologies are reduced. The more advanced feature in this work is an automatic update of file fragments on nodes whenever any changes are done by the third person on that particular node.

Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.

Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.