In this paper we present an introduction to computing anticipatory systems. the internals aspects of anticipation will be explained. the concepts of incursion are proposed to model anticipatory systems. A simple examp...
详细信息
this paper presents middleware enabling mutual and equal transfer of computing power between individuals, as in the original idea behind P2P, while also supporting large-scale distributed computation utilizing heterog...
详细信息
ISBN:
(纸本)0780390741
this paper presents middleware enabling mutual and equal transfer of computing power between individuals, as in the original idea behind P2P, while also supporting large-scale distributed computation utilizing heterogeneous PCs. this goal is strongly supported by a network overlay over which peers can communicate with each other directly and bidirectionally. We made use of a general-purpose P2P library, JXTA, supporting the common requirements of P2P software, including network overlay. Other features of the P2P library, such as ad-hoc self-organization, discovery and grouping of peers, also support our middleware efficiently. In this paper, we propose and evaluate an application of those P2P concepts to virtual resource transfer and parallel computation with aggregated resources. However, such a P2P library imposes a certain amount of overhead on the middleware in terms of communication performance. Measured communication Performance and throughput of an application program shows the feasibility of the application of P2P concepts. the middleware achieves 100 X 10(6) bps communication performance and over a 20 fold increase in speed with 32 computers, even though the granularity of workunits is as fine as less than a second.
We have designed a stackable file system called Redundant Array of Independent Filesystems (RAIF). It combines the data survivability properties and performance benefits of traditional RAIDs withthe unprecedented fle...
详细信息
ISBN:
(纸本)0780390741
We have designed a stackable file system called Redundant Array of Independent Filesystems (RAIF). It combines the data survivability properties and performance benefits of traditional RAIDs withthe unprecedented flexibility of composition, improved security, and ease of development of stackable file systems. RAIF call be mounted on top of any combination of other file systems including network, distributed, disk-based, and memory-based file systems. Existing encryption, compression, antivirus, and consistency checking stackable file systems can be mounted above and below RAIF to efficiently cope up with slow or unsecure branches. Individual files can be distributed across branches, replicated, stored with parity, or stored with erasure correction coding to recover from failures oil multiple branches. Per-file incremental recovery, storage type migration, and load-balancing are especially well suited for grid storages. In this paper we describe the current RAIF design, provide preliminary performance results and discuss current status and future directions.
Grid protocols and technologies are being adopted in a wide variety of academic, government, and industrial environments, and there is a growing body of research-oriented literature in grid computing. However, there i...
详细信息
ISBN:
(纸本)0780390741
Grid protocols and technologies are being adopted in a wide variety of academic, government, and industrial environments, and there is a growing body of research-oriented literature in grid computing. However, there is a need. for educational material that is suitable for classroom use. this paper describes our topics, exercises and experiences of teaching grid computing courses in the fall semester, 2004, to undergraduate computer science students at Lewis & Clark College and to a mix of undergraduate and graduate computer science students at the University of Arkansas. We identify a set of six knowledge areas that can help to structure course material in grid computing. In conclusion, we recommend that a grid computing course cover, or have as prerequisites, material on (1) remote method invocation and (2) security and certificates. Finally, student comments indicate the need for a series of grid programming exercises of increasing complexity.
In this paper we propose the use of a distributed service management architecture for state-of-the-art service-enabled Grids. the architecture is capable of performing automated resource and network bandwidth partitio...
详细信息
ISBN:
(纸本)0780390741
In this paper we propose the use of a distributed service management architecture for state-of-the-art service-enabled Grids. the architecture is capable of performing automated resource and network bandwidth partitioning based on registered Grid resource properties and monitored Grid service demand. A main characteristic is that it enables the use of different service priority schemes and allows for policy-based differentiation between local and foreign service offerings. Resource and network bandwidth partitioning algorithms are introduced and their performance is evaluated on a sample Grid topology using NSGrid, an ns-2 based Grid simulator Our results show that the use of this Service Management Architecture improves resource efficiency, simplifies schedule making decisions, reduces the overall complexity of managing the Grid system, and at the same time improves Grid service QoS support (with regard to job response times) by automatically making Grid resource and network service reservations prior to scheduling.
parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing multiple parallel applications simulta...
详细信息
ISBN:
(纸本)0780390741
parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing multiple parallel applications simultaneously on a group of independently scheduled nodes is not efficient because of synchronization requirements. the central contribution of this paper is to demonstrate that performance of parallel applications with sharing is typically competitive for independent and coordinated (gang) scheduling on small compute clusters. there is a modest overhead due to uncoordinated scheduling but it is often compensated by better sharing of resources. the impact of sharing was studied for different numbers of nodes and threads and different memory and CPU requirements of competing applications. the significance of the CPU time slice, a key parameter in CPU scheduling, was also studied. Application characteristics and operating system scheduling policies are identified as the main factors that influence performance with node sharing. All experiments are performed with NAS benchmarks on a Linux cluster the significance of this research is that it provides evidence to support flexible and decentralized scheduling and resource selection policies for cluster and grid environments.
the development of teachiner materials for future software engineers is critical to the long term success of the Grid. At present however there is considerable turmoil in the Grid community both within the standards a...
详细信息
ISBN:
(纸本)0780390741
the development of teachiner materials for future software engineers is critical to the long term success of the Grid. At present however there is considerable turmoil in the Grid community both within the standards and the technology base underpinning these standards. In this context, it is especially challenging to develop teaching materials that have some sort of lifetime beyond the next wave of Grid middleware and standards. In addition, the current way in which Grid security is supported and delivered has two key problems. Firstly in the case of the UK e-Science community, scalability issues arise from a central certificate authority. Secondly, the current security mechanisms used by the Grid community are not fine grained enough. In this paper we outline how these issues are being addressed through the development of a Grid computing module supported by an advanced authorisation infrastructure at the University of Glasgow.
this paper gives a comparative study on multilayer file sharing mechanisms in Peer-to-Peer (P2P) systems. Based on a well-known P2P system named Gnutella, two system architectures, 1-layer and 2-layer Ngnu architectur...
详细信息
Network security breaches hinder the application of distributedcomputing systems manifested as the Grids, clusters, intranets, extranets, or P2P systems. A new integrated approach is presented for building future, ne...
详细信息
ISBN:
(纸本)0769523129
Network security breaches hinder the application of distributedcomputing systems manifested as the Grids, clusters, intranets, extranets, or P2P systems. A new integrated approach is presented for building future, network-based intrusion detection systems (NIDS). We integrate the Snort (a NIDS) with a custom-designed anomaly detection system (ADS) to yield a powerful cyber defense system, called CAIDS. this system detects known attacks through signature matching and reveals network anomalies by Internet traffic datamining. the CAIDS design integrates two different detection engines for alert correlation between intrusions and anomalies. We aim to automate signature generation into Snort database. the system was tested over an Internet trace of 24 millions of packets containing 200 attacks. Our simulation experiments result in a 75% detection rate on all attacks with a low 5% false alarm rate. the system generates alerts on both intrusive attacks to distributed resources and anomalies detected in the Internet, intranet, and extranet connections.
this paper presents the Optimality theorem in distributedparallel environment. Based on this theorem, a parallel algorithm using network-tree model is presented to compute shortest paths in large-scale networks. the ...
详细信息
ISBN:
(纸本)3540260447
this paper presents the Optimality theorem in distributedparallel environment. Based on this theorem, a parallel algorithm using network-tree model is presented to compute shortest paths in large-scale networks. the correctness of this algorithm is proved theoretically and a series of computational test problems are performed on PC cluster. Factors such as network size and level of the network, which stake effect on the performance, are discussed in detail. Results of the experiments show that the proposed parallel algorithm is efficient in computing shortest paths in large-scale networks, especially when the network size is great.
暂无评论