We discuss the application of Web 2.0 to support scientific research (e-Science) and related 'e-moreorlessanything' applications. Web 2.0 offers interesting technical approaches (protocols, message formats, an...
详细信息
We discuss the application of Web 2.0 to support scientific research (e-Science) and related 'e-moreorlessanything' applications. Web 2.0 offers interesting technical approaches (protocols, message formats, and programming tools) to build core e-infrastructure (cyberinfrastructure) as well as many interesting services (Facebook, YouTube, Amazon S3/EC2, and Google maps) that can add value to e-infrastructure projects. We discuss why some of the original Grid goals of linking the world's computer systems may not be so relevant today and that interoperability is needed at the data and not always at the infrastructure level. Web 2.0 may also support parallel Programming 2.0-a better parallelcomputing software environment motivated by the need to run commodity applications on multicore chips. A 'Grid on the chip' will be a common use of future chips with tens or hundreds of cores. Copyright (C) 2008 John Wiley & Sons, Ltd.
Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide...
详细信息
ISBN:
(纸本)9781605585987
Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide key-based routing capabilities to eliminate flooding in unstructured ones. Many overlay network protocols have been proposed to organize peers into various topologies with emphasis on different networking properties. However, applications are often stuck to a specific peer-to-peer overlay network implementation, because different overlay implementations usually provide very different interfaces and messaging mechanisms. In this paper, we present a framework for constructing peer-to-peer overlay networks in Java. First, networking is abstracted by the interfaces that use URIs to uniformly address peers on different underlying or overlay networks. then, asynchronous and synchronous messaging support is built upon these interfaces. Finally, overlay networking interfaces are sketched to handle specific issues in overlay networks. We have constructed several overlay networks in this framework, and built peer-to-peer applications which are independent of overlay implementations. Copyright 2009 ACM.
When similar business processes are deployed in different organizations, one typically adapts manually a template process to the different execution environments and organizational needs. Service-Oriented Architecture...
详细信息
When similar business processes are deployed in different organizations, one typically adapts manually a template process to the different execution environments and organizational needs. Service-Oriented Architectures facilitate the task of adaptation by exposing the functionalities needed by the process in an abstract way, decoupled from the implementation. Nevertheless, manual intervention to customize the processes is still highly necessary, making it hard to maintain the processes obtained as the result of customizations. Even more complex is the situation where several processes are customized independently but they are still treated as linked with each other or inherited from one base (reference) process. In this paper, we provide an initial investigation of customization of controllable processes.
We introduce a new strategy for structuring large searches in model checking, called local search, as an alternative to depth-first and breadth-first search. It is designed to optimise the amount of checking that is d...
详细信息
A system implemented in MATLAB is described, which may be deployed over a Campus Grid utilizing the Condor job management system. Our approach can re-distribute jobs as node availability changes. the architecture of t...
详细信息
A system implemented in MATLAB is described, which may be deployed over a Campus Grid utilizing the Condor job management system. Our approach can re-distribute jobs as node availability changes. the architecture of the system, its components, and their deployment across the Cardiff University Campus Grid (consisting of 2500 machines) are presented. Challenges in image processing applications that can be deployed over such infrastructure are presented, along with performance results that demonstrate the use of our system alongside a standard Condor deployment, demonstrating a significant increase in throughput using our approach(double dagger). Copyright (C) 2008 John Wiley & Sons, Ltd.
the paper focuses on the control design of LPV and qLPV models via TS fuzzy model representation and Linear Matrix Inequality (LMI) based design under the paralleldistributed Compensation control design framework. th...
详细信息
the paper focuses on the control design of LPV and qLPV models via TS fuzzy model representation and Linear Matrix Inequality (LMI) based design under the paralleldistributed Compensation control design framework. the related literature reports considerable research on how to manipulate with LMI's to achieve better control performance. this paper shows that this effort is not enough, the optimization of the control performance must include the convex hull manipulation on the TS fuzzy model beside manipulating withthe LMIs. the LMI's guaranty the optimal solution for a given convex hull, but the convex hull representation is not invariant. Furthermore, the solutions by LMI's are very sensitive for the convex hull. the paper proposes a systematic concept for various convex hull manipulation method.
For providers of composite services, service level agreements (SLAs) provide a means to guarantee a certain service quality to prospective customers. Usually, violating SLAs is associated with costs. However, the mean...
详细信息
For providers of composite services, service level agreements (SLAs) provide a means to guarantee a certain service quality to prospective customers. Usually, violating SLAs is associated with costs. However, the means necessary to ensure SLA conformance also generate costs. Oftentimes, it is therefore optimal from a business perspective to violate certain SLAs sometimes, instead of trying for the high (and expensive) road of always satisfying each one. In this paper we will sketch a frame- work for the prediction of SLA violations and for determining whether an adaptation of the process makes sense economically. If this is the case adaptation actions are triggered, which adapt the composition on either on instance, structural or environmental level. the ultimate goal is to implement a closed-loop system, which self-optimizes the costs resulting from SLA violations.
Resource selection on current brokers still presents challenges for achieving the best solution in the decision-making process, especially when considering many factors. We approach this problem considering user prefe...
详细信息
Resource selection on current brokers still presents challenges for achieving the best solution in the decision-making process, especially when considering many factors. We approach this problem considering user preference for specific resource selection objectives such as expected performance for an application execution, resource access restriction, execution application cost, and resource reliability. For each objective, we employ different techniques and combine them in a decision theory model. By considering performance in the selection process, we use the case-based reasoning technique based on similar past job executions to predict a new job time execution. Withthe resource access restriction as a selection factor, we develop a fine-grain policy-based model for distributed resource access verification. Unlike a global access policy, which applies to all resources in a virtual organization, a fine-grain policy establishes rules for specific resources and users. In this case, a previous access restriction verification prevents a resource selection, which may deny access to a requisition, resulting in an unsuccessful submission. the decision model uses the multi-attribute utility theory, which relates the important objectives above and allows different proportions of user preferences for each objective. the complete solution is distributed and implemented using a multi-agent system, acting as at resource broker. All models of this paper are analyzed in a real environment, presenting appropriate functional behaviors. Results, show that our prediction model is accurate and efficient in the prediction process and our distributed model runs faster than centralized approaches and considers access restriction heterogeneities. Copyright (C) 2008 John Wiley & Sons, Ltd.
the use of Graphics Processing Units (GPUs) in general purpose computing has been shown to incur significant performance benefits, for applications ranging from scientific computing to database sorting and search. In ...
详细信息
the use of Graphics Processing Units (GPUs) in general purpose computing has been shown to incur significant performance benefits, for applications ranging from scientific computing to database sorting and search. In this paper we try to evaluate the execution of integer arithmetic operation on CPU and GPU processors. We evaluate the execution from both performance and power consumption perspectives.
the rising interest in Java for High Performance computing (HPC) is based on the appealing features of this language for programming multi-core cluster architectures, particularly the built-in networking and multithre...
详细信息
ISBN:
(纸本)9781605585987
the rising interest in Java for High Performance computing (HPC) is based on the appealing features of this language for programming multi-core cluster architectures, particularly the built-in networking and multithreading support, and the continuous increase in Java Virtual Machine (JVM) performance. However, its adoption in this area is being delayed by the lack of analysis of the existing programming options in Java for HPC and evaluations of their performance, as well as the unawareness of the current research projects in this field, whose solutions are needed in order to boost the embracement of Java in HPC. this paper analyzes the current state of Java for HPC, both for shared and distributed memory programming, presents related research projects, and finally, evaluates the performance of current Java HPC solutions and research developments on a multi-core cluster with a high-speed network, InfiniBand, and a 24-core shared memory machine. the main conclusions are that: (1) the significant interest on Java for HPC has led to the development of numerous projects, although usually quite modest, which may have prevented a higher development of Java in this field;and (2) Java can achieve almost similar performance to native languages, both for sequential and parallel applications, being an alternative for HPC programming. thus, the good prospects of Java in this area are attracting the attention of both industry and academia, which can take significant advantage of Java adoption in HPC. Copyright 2009 ACM.
暂无评论