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.
A shared memory parallel computer system can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive to evaluate the performance of a single queue parallel server queuing...
From the queuing system approach, a compute intensive application can be defined as any application where the arrival rate of processes into the processors queue is greater than the overall departure rate of the processes from the processors. Such a compute intensive application is ideal for a parallel computer because there are always processes for the processors to execute. This paper, therefore,...
A new abstraction - the parallel supply function (PSF) - is proposed for representing the computing capabilities offered by virtual platforms implemented atop identical multiprocessors. It is shown that this abstraction is strictly more powerful than previously-proposed ones, from the perspective of more accurately representing the inherent parallelism of the provided computing capabilities. Sufficient...
This paper presents a proposal of a collusion-resistant sabotage-tolerance mechanism against malicious sabotage attempts in volunteer computing (VC) systems. While VC systems reach the most powerful computing platforms, they are vulnerable to mischief because volunteers can output erroneous results, for various reasons ranging from hardware failure to intentional sabotage. To protect the integrity...
Grid computing integrates scattered clusters, servers, storages and networks in different geographic locations to form a virtual super-computer. Along with the development of grid computing, dealing with the data distribution requires a method which is faster and more effective for parallel applications in order to reduce data exchange between clusters. In this paper, we present two methods to reduce...
Grid technology has been intensively developed lasting recent years, due to a need for high performance computing to process large amounts of data distributed around global networks. In addition to the improved performance obtained by parallel processing, this technology enables resources distributed among different nodes to be shared. In this study, the problem of transferring files that are generated...
The lightweight time warp (LTW) protocol offers a novel approach to high-performance optimistic parallel discrete-event simulation, especially when a large number of simultaneous events need to be executed at each virtual time. With LTW, the local simulation space on each node is partitioned into two sub-domains, allowing purely optimistic simulation to be driven by only a few full-fledged logical...
Rapid evaluation of potentials in large physical systems plays a crucial role in several fields and has been an intensely studied topic on parallel computers. Computational methods and associated parallel algorithms tend to vary depending on the potential being computed. Real applications often involve multiple potentials, leading to increased complexity and the need to strike a balance between competing...
With the advent of next-generation high throughput sequencing instruments, large volumes of short sequence data are generated at an unprecedented rate. Processing and analyzing these massive data requires overcoming several challenges including mapping of generated short sequences to a reference genome. This computationally intensive process takes time on the order of days using existing sequential...
Metaschedulers can distribute parts of a bag-of-tasks (BoT) application among various resource providers in order to speed up its execution. When providers cannot disclose private information such as their load and computing power, which are usually heterogeneous, the metascheduler needs to make blind scheduling decisions. We propose three policies for composing resource offers to schedule deadline-constrained...
We introduce a simple and flexible method to price derivative securities on assets with volatilities which are stochastic. As a special case we treat the SABR model in more detail. Our approach is based on the construction of recombining trees using interpolation methods on probability measures, and this makes it very suitable for the application of parallel computing techniques. We show how one can...
A hybrid MPI/OpenMP method of parallelising a bi-conjugate gradient iterative solver for coupled thermo-hydro-mechanical finite-element simulations in unsaturated soil is implemented and found to be efficient on modern parallel computers. In particular, a new method of parallelisation using a hybrid multi-threaded and message-passing approach depending on calculation size was implemented yielding...
Transaction processing is one of the key technologies that decide whether Web services and its composition services can be widely used. To deal with reliability and consistency of Web services in distributed environment, this paper presents a web services transaction compensation Paired Place/Transition model, and discusses the execution semantics of the sequence and parallel composition compensation...
As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we present an analytical study to estimate execution time in the presence of failures of directed acyclic graph (DAG) based scientific applications and provide a guideline for performance optimization. The study is four fold. We...
Array-OL is a high-level specification language dedicated to the definition of multi-dimensional intensive signal processing applications. It allows to specify both the task parallelism and the data parallelism of these applications on focusing on their complex multidimensional data access patterns. Several tools exist for implementing an array-OL specification as a data parallel program. While array-OL...
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as well as low-level, performance-oriented kernels. But analysis of system-level trade-offs has been inhibited by the diversity of models and the dynamic nature of modern dataflow applications. To facilitate design space exploration...
Service level agreements (SLAs) is currently one of the major research topics in grid computing. Among many system components for the supporting of SLA-aware Grid- based workflow, the SLA mapping module receives important positions. Optimizing execution time is an important task of the mapping module as it helps in finding out a feasible solution when the Grid is busy or by eliminating the negative...
The advent of multicores presents a promising opportunity for speeding up sequential programs via profile-based speculative parallelization of these programs. In this paper we present a novel solution for efficiently supporting software speculation on multicore processors. We propose the Copy or Discard (CorD) execution model in which the state of speculative parallel threads is maintained separately...
Multicore processors promise continued hardware performance improvements even as single-core performance flattens out. However they also enable increasingly complex application software that threatens to obfuscate application-level performance. This paper applies operational analysis to the problem of understanding and predicting application-level performance in parallel servers. We present operational...
Stable processes can model the impulsive random noises better than Gaussian distribution in array signal processing. This paper proposes a new FOC-ESPRIT method of 2-D direction finding based on the fractional order correlation and subspace technique for underwater 2-D source localization using a vector hydrophones array. Simulation experiments show that the proposed method is robust in a wide range...
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.