Today's cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an increase in computational complexity. T...
详细信息
ISBN:
(纸本)3540240136
Today's cryptanalysis on symmetric key cryptography is encouraging the use of larger key sizes and complex algorithms to achieve an unbreakable state. However, this leads an increase in computational complexity. this has promoted many researchers to develop high-performance symmetric key cryptography schemes using approaches such as the use of high-end computing hardware. Peer-to-peer (P2P) or enterprise grids are proven as one of the approaches for developing cost-effective high-end computing systems. By utilizing them, one can improve the performance of symmetric key cryptography through parallel execution. this approach makes it attractive for adoption by businesses to secure their documents. In this paper we propose and develop an application for symmetric key cryptography using enterprise grid middleware called Alchemi. An analysis and comparison of its performance is presented along with pointers to future work.
Grid computing is a fast developing technology as an approach to do high performance scientific and engineering computation. the research work on Grid performance evaluation and modeling, an important supporting facto...
详细信息
ISBN:
(纸本)3540240136
Grid computing is a fast developing technology as an approach to do high performance scientific and engineering computation. the research work on Grid performance evaluation and modeling, an important supporting factor, is still immature and not considered inherently grid middleware design. In this paper, we proposed a scheduler oriented grid performance evaluation approach so that it closely cooperates with grid schedulers. A typical scenario of how the the grid performance modules interact withthe scheduler is also introduced and analyzed. the advantage is that the grid scheduler is able to get more performance information about remote sites and hence improve the scheduling policy for grid jobs and ensure the quality of service to some extent.
Super scheduling is notoriously difficult and challenging in grid computing due to the very dynamic and unpredictable nature. In this paper, we adopt a hierarchical scheduling architecture, within which, both online a...
详细信息
ISBN:
(纸本)3540240136
Super scheduling is notoriously difficult and challenging in grid computing due to the very dynamic and unpredictable nature. In this paper, we adopt a hierarchical scheduling architecture, within which, both online and batch mode super scheduling policies are developed. Two new online scheduling algorithms are presented and compared withthe algorithms in the literature. the extensive simulation study of these algorithms is conducted. the results show that when simultaneously considering boththe loads of sites and data location, the average response time and average stretch can be considerably smaller than those when using policies that only consider loads or data location alone.
Nowadays, it is very important that integrating parallel processors on a chip offers high performance and low interactive response time on applications with fine-grained parallelism and high degree of data sharing. We...
详细信息
ISBN:
(纸本)3540240136
Nowadays, it is very important that integrating parallel processors on a chip offers high performance and low interactive response time on applications with fine-grained parallelism and high degree of data sharing. We propose a novel real-shared cache module with new multiport ring-bus architecture to overcome the bus bottleneck problem of the existing parallel processors chip on shared cache level. A testbench of solving a large scale of simultaneous linear equation is also designed to evaluate such architecture. the evaluation results show that it can offer immediate data sharing without conflicts or delay, and the performance of parallel processors chips with such novel real-shared cache module improves in proportion to the number of processor elements.
Most of the task allocation models & algorithms in distributedcomputing System (DCS) require a priori knowledge of its execution time on the processing nodes. Since the task assignment is not known in advance, th...
详细信息
ISBN:
(纸本)0769521320
Most of the task allocation models & algorithms in distributedcomputing System (DCS) require a priori knowledge of its execution time on the processing nodes. Since the task assignment is not known in advance, this time is quite difficult to estimate. We propose a cluster-based dynamic allocation scheme, in a distributedcomputing system, which eliminate this time requirement. Further, as opposed to a single task allocation, generally proposed in most of the models, we consider multiple tasks. A fuzzy function is used for boththe module clustering and processor clustering. Dynamic invocation of clustering and assignment is considered. Experimental results show the efficacy of the proposed model.
Withthe momentum gaining for the grid computing systems, the issue of deploying support for integrated scheduling and fault-tolerant approaches becomes paramount importance. Unfortunately, fault-tolerance have not be...
详细信息
ISBN:
(纸本)0769521320
Withthe momentum gaining for the grid computing systems, the issue of deploying support for integrated scheduling and fault-tolerant approaches becomes paramount importance. Unfortunately, fault-tolerance have not been factored into the design of most existing Grid scheduling strategies. To this end, we propose a fault-tolerant scheduling policy that loosely couples job scheduling with job replication scheme such that jobs are efficiently and reliably executed. Performance evaluation of the proposed fault-tolerant scheduler against a non-fault-tolerant scheduling policy is presented and shown that the proposed policy performs reasonably in the presence of various types of failures.
this paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. the proposed scheme repeatedly estimates and updates the total lookup latency based on the information fro...
详细信息
ISBN:
(纸本)3540240136
this paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. the proposed scheme repeatedly estimates and updates the total lookup latency based on the information from the neighborhoods. the updated information is used to select the next peer dynamically to route the query, which results in reducing the overall lookup latency. We implemented the scheme using the Chord, one of the most popular DHT-based peer to peer systems, and compared the performance withthose of original Chord and the CFS' server selection scheme. the proposed scheme shows performance improvement over other schemes.
Super-scheduling in a dynamic grid environment is a very challenging issue that remains to be solved before a grid can be deployed and effectively utilized. In this paper we investigate a paradigm based on genetic alg...
详细信息
ISBN:
(纸本)3540240136
Super-scheduling in a dynamic grid environment is a very challenging issue that remains to be solved before a grid can be deployed and effectively utilized. In this paper we investigate a paradigm based on genetic algorithms (GA) to efficiently solve the scheduling problem. this CA paradigm is architecturally combined withthe multiagent system (MAS) paradigm to form a flexible super-scheduling system. A three-layered scheduling architecture is presented and the corresponding realization of a multiagent-based system is described. the experiment shows that the better scheduling results are obtained for the adopted metrics of flow time and job stretch.
Two approaches are used to reduce the overhead associated with coordinated checkpointing: one is to reduce the number of synchronization messages and the number of checkpoints;the other is to make the checkpointing pr...
详细信息
ISBN:
(纸本)3540240136
Two approaches are used to reduce the overhead associated with coordinated checkpointing: one is to reduce the number of synchronization messages and the number of checkpoints;the other is to make the checkpointing process non-blocking. In this paper, we introduce the concept of "computing checkpoint" to design an efficient consistent non-blocking coordinated checkpointing algorithm that combines these two approaches. through piggybacking the information that which processes have taken new checkpoints in the broadcast committing message, the checkpoint sequence number of every process can be kept consistent in all processes, so that the unnecessary checkpoints and orphan messages can be avoided in the future running. the algorithm needn't block any process and has lower overhead than other proposed consistent coordinated checkpointing algorithms.
A major challenge in deploying collaborative agent-based distributed systems in open environments is how to deal with trust and security issues. Traditional security strategies that use system-based control to verify ...
详细信息
ISBN:
(纸本)1889335231
A major challenge in deploying collaborative agent-based distributed systems in open environments is how to deal with trust and security issues. Traditional security strategies that use system-based control to verify the identity of individual agent are inadequate for the increased flexibility, In this paper, we examine current security approaches for managing trust and propose a new model for trust and trust management for collaborative agent-based systems. We present an approach using a trust facilitator, which can provide trust values of interacting agents to help request agents make trust-related decisions.
暂无评论