Recent developments in the international arena has meant the technology is now mature enough to bring together those required for the implementation of a grid computing facility. this paper examines the requirements a...
详细信息
ISBN:
(纸本)0769517722
Recent developments in the international arena has meant the technology is now mature enough to bring together those required for the implementation of a grid computing facility. this paper examines the requirements and applications for an eScience infrastructure with particular reference to developments in Europe.
this paper presents a highperformance communication system based on generic programming. the system adapts itself according to the protocol being used on communication, simplifying the development of libraries. In or...
详细信息
As distributed applications such as Grid and enterprise systems scale up and become increasingly complex, their authorization infrastructures-based predominantly on the request-response paradigm-are facing challenges ...
详细信息
ISBN:
(纸本)1595936734
As distributed applications such as Grid and enterprise systems scale up and become increasingly complex, their authorization infrastructures-based predominantly on the request-response paradigm-are facing challenges in terms of fragility and poor scalability. We propose an approach where each application server caches previously received authorizations at its secondary decision point and shares them with other application servers to mask authorization server failures and network *** paper presents the design of our cooperative secondary authorization recycling system and its evaluation using simulation and prototype implementation. the results demonstrate that our approach improves the availability of authorization infrastructures while preserving their performance characteristics. Specifically, by sharing authorizations, the cache hit *** indirect metric of *** reach 70%, even when only 10% of authorizations are cached. Depending on the deployment scenario, the performance in terms of the average time for authorizing an application request can be reduced by up to 30%. Copyright 2007 ACM.
Welcome to the 16th Workshop on Interaction between Compilers and computerarchitectures (INTERACT-16), held on February 25, 2012, in New Orleans, Louisiana. this year, the workshop was held in conjunction withthe 18...
详细信息
Fog computing extends the Cloud computing paradigm to the edge of the network, developing a decentralized infrastructure in which services are distributed to locations that best meet the needs of the applications such...
详细信息
ISBN:
(纸本)9781538677698
Fog computing extends the Cloud computing paradigm to the edge of the network, developing a decentralized infrastructure in which services are distributed to locations that best meet the needs of the applications such as low communication latency, data caching or confidentiality. P2P-based platforms are good candidates to host Fog computing, but they usually lack important elements such as controlling where the data is stored and who will handle the computing tasks. As a consequence, controlling where the data is stored becomes as important as controlling who handle it. In this paper we propose different techniques to reinforce data-locality for P2P-based middlewares, and study how these techniques can be implemented. Experimental results demonstrate the interest of data locality on the data access performances.
computerarchitectures for highperformancecomputing have traditionally been based on an assumption of one parallel application running alone on one machine. the current trend is, however, that huge computer installa...
详细信息
ISBN:
(纸本)9781424449217
computerarchitectures for highperformancecomputing have traditionally been based on an assumption of one parallel application running alone on one machine. the current trend is, however, that huge computer installations offer compute power to a set of users or customers, each demanding only a subset of the available compute resources. this places new requirements on the architecture, in that it must support dynamic partitioning of the resources into several virtual servers as demand changes. We introduce a novel framework which supports flexible formation of such virtual servers while preventing interference between the communication of different virtual servers. this paper investigates the impacts of a shared interconnection network on applications running on virtual compute servers. We show that the interconnect performance supplied to each job is highly unpredictable, and that a job can experience a performance degradation of 97% when its traffic interferes withthe traffic of concurrent jobs. With a minor reduction in the utilization of each processing node, this can be considerably improved through a combination of routing-containment in the interconnection network and a carefully designed resource allocation strategy.
A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v is an element of V, the neighbors of v are consecutive in W. In this work we describe a BSP/CGM algorith...
详细信息
ISBN:
(纸本)0769520464
A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v is an element of V, the neighbors of v are consecutive in W. In this work we describe a BSP/CGM algorithm for finding a maximum matching in a convex bipartite graph. For p processors, the algorithm runs in time O((\V\/p) lg(\V\/p) lgp) and it uses O(lgp) communication rounds.
We present and analyze techniques to efficiently solve the partial content distribution problem-distributing a logical data set to receivers which individually desire only subsets of the total data. this is a more gen...
详细信息
ISBN:
(纸本)1595936734
We present and analyze techniques to efficiently solve the partial content distribution problem-distributing a logical data set to receivers which individually desire only subsets of the total data. this is a more general and fundamentally different problem than traditional whole-file content distribution;providing new challenges and new optimization opportunities. It supports a wider variety of use models, e.g., striped file transfer, scatter/gather, or distributed editing. this work develops new metadata management and transfer scheduling techniques providing good results on highperformance networks. Distributed applicationsin such systems tend to have data requirements more complicated than just total overlap at every node: transfers desired differ dramatically from whole-file content distribution. Traditional approaches perform poorly in such cases. We provide empirical data exhibiting these limitations, evaluate a new BitTorrent-based implementation of our ideas, and show order of magnitude improvements in bandwidth and latency. Copyright 2007 ACM.
Mobile devices are often expected to perform computational tasks that may be beyond their processing or battery capability. Cloud computing techniques have been proposed as a means to offload a mobile device's com...
详细信息
ISBN:
(纸本)9781479984619
Mobile devices are often expected to perform computational tasks that may be beyond their processing or battery capability. Cloud computing techniques have been proposed as a means to offload a mobile device's computation to more powerful resources. In this paper, we consider the case where powerful computing resources are employed on a vehicle, thus they can be re-positioned in real time. User-carried devices with no Internet connectivity wish to initiate computing tasks to be run on a remote computer. this scenario finds application in challenged environments and may be used in a military or disaster relief setting. It is further enabled by increasing feasibility of constructing a Mobile highperformancecomputer (MHPC) using rugged computer hardware with form factors that can be deployed in vehicles. By analogy to prior work on message ferries and data mules, one can refer to the use of MHPCs as computational ferrying. After illustrating and motivating the computational ferrying concept, we turn our attention into the challenges facing such a deployment. these include the well-known challenges of operating an opportunistic and intermittently connected network using message ferries-such as devising an efficient mobility plan for MHPCs and developing techniques for proximity awareness. In addition such a system must include computation offtoading decision making mechanisms to be deployed by mobile users, techniques for scheduling computation on MHPCs, and for handling possible mobility of the users. In this paper, first we propose an architecture for the system components to be deployed on the mobile users and the MHPCs. We then provide solutions to the MHPC movement scheduling problem with sufficient generality to describe a number of plausible deployment scenarios. Finally, we report and discuss some preliminary results.
In desktop grids the use of off-the-shelf shared components makes the use of dedicated resources economically nonviable and increases the complexity of design of efficient storage systems that are required to address ...
详细信息
ISBN:
(纸本)1595936734
In desktop grids the use of off-the-shelf shared components makes the use of dedicated resources economically nonviable and increases the complexity of design of efficient storage systems that are required to address the exponentially growing storage demands of modern applications that run on these platforms. To address this challenge, we present PeerStripe, a storage system that transparently distributes files to storage space contributed by participants that have joined a peer-to-peer (p2p) network. PeerStripe uses structured p2p routing to yield a scalable, robust, reliable, and self-organizing storage system. the novelty of PeerStripe lies in its ingenious use of striping and error coding techniques in a heterogeneous distributed environment to stor every large data files. Our evaluation of PeerStripe shows that it can achieve acceptable performance for applications in desktop grids.
暂无评论