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.
In this paper, we describe a new source code transformation called dynamic loop reversal that can increase temporal and spatial locality. We also describe a formal method for predicting the cache behaviour and evaluation results of the accuracy of the model by measurements on a cache monitor. The comparisons of the numbers of measured cache misses and the numbers of cache misses estimated by the model...
Computations with sparse matrices are widespread in scientific projects. Commonly used storage formats (such as COO or CSR) are not suitable for I/O file operations with sparse matrices due to their high space complexities. Memory-efficient formats are still under development. In this paper, we present a new storage format called the {\em Minimal quad tree} (MQ) as well as algorithms for converting...
In this paper, we propose and evaluate new storage formats for sparse matrices that minimize the space complexity of information about matrix structure. The motivation of our work are applications with very large sparse matrices that due to their size must be processed on massively parallel computer systems consisting of tens or hundreds of thousands of processor cores and that must be stored in a...
Techniques for building local area network clusters differ from those used for large scale harvesting of idle computing power. The overlapping non dedicated clusters (ONDC) architecture is trying to mix advantages of both techniques. Clusters build in ONDC style can be deployed both on small scale local networks, but as well in large scale over the Internet deployments. In this paper we analyze the...
We live in a world where is no problem to own quite powerful workstation. However, despite of such concepts like volunteer computing, grid and cluster computing, there is still a high number of idle workstations that are wasting their computational potentials. We believe that better utilization of an idle computing power can be achieved by economical stimulations. In our recent work, we designed a...
Non-dedicated computer clusters promise more efficient resource utilization than conventional dedicated clusters. Existing non-dedicated clustering solutions either expect trust among participating users, or they do not take into account a possibility of running multiple independent clusters on a same set of computers.In this paper, we argue how an ability to run multiple independent clusters without...
Clusters built from commodity computers are popular because of their cost efficiency. There are two basic types of such clusters. A prevalent type is a dedicated cluster where all machines participating in the cluster belong to a single administrative domain. Then there are non-dedicated clusters, where the cluster itself forms its own administrative domain, but the participating computers retain...
This paper proposes mechanisms for the protection of high-performance systems that are built of non-dedicated workstations. Such workstations may potentially be under control of malicious users that may gain complete control over the processes running there. The protection is achieved by a careful assignment of processes to computing nodes. If a process runs on a workstation with limited credibility,...
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.