The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As one of IaaS (Infrastructure-as-a-Service), it is beneficial to arrange virtual machines dynamically to applications based on resource provisioning mechanism. However, it is challenging to apply scheduling scheme to utilize resources efficiently when many tasks require a lot of resources at the same time. Especially, scientific applications, which require large-scale computing resource for long...
Cloud computing is commonly characterized as a three-layer architecture including IaaS, PaaS and SaaS, while service oriented approach is widely considered as a promising software development method. In this paper, we report our early experience of moving traditional service oriented software development to the cloud computing environment. Our primary goal is to provide instant development, instant...
In this paper, we design and evaluate a remote memory disk cache (RMDC) for high-performance disk I/O. For this purpose, we propose the Remote Memory Block Device (RMBD) that abstracts a set of remote memory regions into a local block device. The RMBD can be used as a cache device for any block devices as well as a stand-alone block device. We evaluate the RMDC using standard benchmarks such as TPC-C,...
Periodic, coordinated, checkpointing to disk is the most prevalent fault tolerance method used in modern large-scale, capability class, high-performance computing (HPC) systems. Previous work has shown that as the system grows in size, the inherent synchronization of coordinated checkpoint/restart (CR) limits application scalability; at large node counts the application spends most of its time checkpointing...
Understanding the behavior of current and future workloads is key for designers of future computer systems. If target workload characteristics are available, computer designers can use this information to optimize the system. This can lead to a chicken-and-egg problem: how does one characterize application behavior for an architecture that is a moving target and for which sophisticated modeling tools...
The interconnection network communicates and links together the processing units of modern high-performance computing systems. In this context, network faults have an extremely high impact since most routing algorithms were not designed to tolerate faults. Because of this, just a single fault may stall messages in the network, preventing the finalization of applications, or may lead to deadlocked...
Interconnect technologies play a great role in the efficiency and scalability of high-performance systems. The capability of low latency, high bandwidth, high message rate and low CPU overhead greatly influence application performance and overall system productivity. In the paper we explore two different architectures of high-speed interconnects-offloading interconnects (where the interconnect handles...
We have proposed a power-aware, dependable, and high-performance communication link using PCI Express as a direct communication device, referred to as PEARL for application in a wide range of parallel and distributed systems from high-end embedded systems to small-scale high-performance clusters. The PEACH chip, as a communicator chip for realizing PEARL, concentrates four ports of PCI Express Gen...
One of the main challenges in the multi-core area is the communication and synchronization of the cores and the design of an efficient interconnection network that is scalable to multiple cores. In this paper we present an efficient implementation of a scalable system that is targeting multi-core systems. Each cluster node consists of 4 processors that support both explicit and implicit communication...
As the number of user-managed devices continues to increase, the need for synchronizing multiple file hierarchies distributed over devices with ad hoc connectivity, is becoming a significant problem. In this paper, we propose a new approach for efficient cloud-based synchronization of an arbitrary number of distributed file system hierarchies. Our approach maintains both the advantages of peer-to-peer...
Topology optimization of truss structures is considered in this paper. Trusses are widely used in various constructions: bridges, towers, roof supporting structures. Topology optimization of trusses requires large amount of computing resources. Therefore distributed computer networks are used to solve this kind of problems. In this paper a distributed branch-and-bound combinatorial algorithm for topology...
Many-core graphics processors are playing today an important role in the advancements of modern highly concurrent processors. Their ability to accelerate computation is being explored under several scientific fields. In the current paper we present the acceleration of a widely used data clustering algorithm, K-means, in the context of high performance GPU clusters. As opposed to most related implementation...
The iPlant Collaborative is a 5-year, National Science Foundation-funded effort to develop cyberinfrastructure to address a series of grand challenges in plant science. The second of these grand challenges is the Genotype-to-Phenotype project, which seeks to provide tools, in the form of a web-based Discovery Environment, for understanding the developmental process from DNA to a full-grown plant....
We consider a population based Particle Swarm Optimization (PSO) algorithm and a few modifications to increase quality of optimization. Several strategies are investigated to exchange data between processors in parallel algorithm. Experimental investigation is performed on Multiple Gravity Assist problem. The results are compared with original PSO.
Efficiency of parallel branch and bound algorithms depends on the selection strategy. The influence to the performance of parallel MPI branch and bound algorithm with simplicial partitions and aggregate Lipschitz bound using different selection strategy is evaluated experimentally. The experiments have been performed solving a number of multidimensional test problems for global optimization.
Heterogeneous computing which includes mixed architectures with multi-core CPUs as well as hardware accelerators such as GPU hardware, is needed to satisfy future computational needs and energy requirements. Cloud computing currently offers users whose computational needs vary greatly over time, a cost-effect way to gain access to resources. While the current form of cloud-based systems is suitable...
Heterogeneous clusters with multiple sockets and multicore-processors accelerated by dedicated coprocessors like GPUs, Cell BE, FPGAs or others nowadays provide unrivaled computing power in terms of floating point operations. Specific capabilities of additional processor technologies enable dedicated exploitation with respect to particular application and data characteristics. However, resource utilization,...
Checking if a triangle intersects a box is a fundamental part of computer graphics algorithms and should be both robust and highly optimized for higher level algorithms to work correctly and efficiently. This paper analyzes and presents an improved and more robust version of the current state-of-the-art algorithm for determining intersection between a triangle and a box. This algorithm has been rewritten...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.