MemFS is a fully-symmetrical, in-memorydistributed runtime file system. Its design is based on uniformly distributing file stripes across the storage nodes belonging to an application by means of a distributed hash f...
详细信息
ISBN:
(纸本)9781479955480
MemFS is a fully-symmetrical, in-memorydistributed runtime file system. Its design is based on uniformly distributing file stripes across the storage nodes belonging to an application by means of a distributed hash function, purposefully sacrificing data locality for balancing both network traffic and memory consumption. This way, reading and writing files can benefit from full network bisection bandwidth, while data distribution is balanced across the storage servers.
Content-based Pub/Sub paradigm has been widely used in many distributed applications and existing approaches suffer from high redundancy subscription index structure and low matching efficiency. To tackle this issue, ...
详细信息
ISBN:
(纸本)9781665445139
Content-based Pub/Sub paradigm has been widely used in many distributed applications and existing approaches suffer from high redundancy subscription index structure and low matching efficiency. To tackle this issue, in this paper, we propose a learning framework to guide the construction of an efficient in-memory subscription index, namely PMlndex, via a multi-task learning framework. The key of PMIndex is to merge redundant subscriptions into an optimal number of partitions for less memory cost and faster matching time. Our initial experimental result on a synthetic dataset demonstrates that PMindex outperforms two state-of-the-arts by faster matching time and less memory cost.
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed ...
详细信息
ISBN:
(纸本)0818673982
We consider a shared store based on distributed shared memory (DSM), supporting persistence by reachability (PBR), a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a general model for DSM+PBR, we specify a distributed GC algorithm that is efficient and scalable. Its main features are: (i) independent collection of memory subsets (even when replicated), (ii) orthogonal from coherence, (iii) asynchrony, and (iv) a simple heuristic to collect cycles avoiding extra I/O costs. We briefly describe our implementation and show some performance results.
We propose a new concept of minmax memory claim (MMC) to achieve cost-effective workflow computations in in-memory cloud computing environments. The minmax-memory claim is defined as the minimum amount of memory requi...
详细信息
ISBN:
(纸本)9781509014828
We propose a new concept of minmax memory claim (MMC) to achieve cost-effective workflow computations in in-memory cloud computing environments. The minmax-memory claim is defined as the minimum amount of memory required to finish the workflow without compromising its maximum concurrency. With MMC, the workflow tenants can achieve the best performance via the maximum concurrency while minimizing the cost to use the memory resources. In this paper, we present the algorithms to find the MMC for workflow computation and evaluate its value by applying it to deadlock avoidance algorithms.
In this paper we present the design and implementation of a conservative garbage collection algorithms for distributed shared memory (DSM) applications that use weakly-typed languages like C or C++, and evaluate its p...
详细信息
ISBN:
(纸本)0818673982
In this paper we present the design and implementation of a conservative garbage collection algorithms for distributed shared memory (DSM) applications that use weakly-typed languages like C or C++, and evaluate its performance. In the absence of language support to identify references, our algorithm constructed a conservative approximation of the set of cross-node references based on local information only. It was also designed to tolerate memory inconsistency on DSM systems that use relaxed consistency protocols. These techniques enabled every node to perform garbage collections without communicating with others, effectively avoiding the high cost of cross-node communication in networks of workstations. We measured the performance of our garbage collector against explicit programmer management using three application programs. In two out of the three programs the performance of the GC version is within 15% of the explicit version. The results showed that the garbage collector has two effects on application programs. On one hand, it tends to reduce memory locality, increasing the communication cost;on the other hand, it may eliminate synchronization and memory accesses that would be incurred if memory were managed by the programmer, reducing the communication cost.
We used the Spin model checker to show that Intel's implementation of software transactional memory is correct. Transactional memory makes it possible to write properly-synchronized multi-threaded programs without...
详细信息
ISBN:
(纸本)9781424444816
We used the Spin model checker to show that Intel's implementation of software transactional memory is correct. Transactional memory makes it possible to write properly-synchronized multi-threaded programs without the explicit use of locks. We describe our model of Intel's implementation, our experience with Spin, what we have shown, and what obstacles remain to showing more.
We present a method for parallel computing the coupling capacitances of multi-conductor structures on a network of workstations using a message-passing type communication library. The indirect BEM in SD-case is used. ...
详细信息
We present a method for parallel computing the coupling capacitances of multi-conductor structures on a network of workstations using a message-passing type communication library. The indirect BEM in SD-case is used. The coefficient matrix is subdivided and independently computed on each workstation. The solution of the linear equation system is performed by a distributed GMRES-algorithm. The computation can be further accelerated by use of a load balancing algorithm.
The traditional distributed Shared memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore, multi-object operations such as double compare and swap, and atomic m-register assignm...
详细信息
ISBN:
(纸本)0780350049
The traditional distributed Shared memory (DSM) model provides atomicity at levels of read and write on single objects. Therefore, multi-object operations such as double compare and swap, and atomic m-register assignment cannot be efficiently expressed in this model, We extend the traditional DSM model to allow operations to span multiple objects. We shaw that memory consistency conditions such as sequential consistency and linearizability can be extended to this general model. We also provide algorithms to implement these consistency conditions in a distributed system.
The Big Data computing is one of hot spots of the internet of things and cloud computing. How to compute efficiently on the Big Data is the key of improving performance. By means of distributedcomputing or memory com...
详细信息
ISBN:
(纸本)9781509018932
The Big Data computing is one of hot spots of the internet of things and cloud computing. How to compute efficiently on the Big Data is the key of improving performance. By means of distributedcomputing or memorycomputing, many companies and institutions provide some technologies and produces. But they are invalid in the scene in which there are real-time demands in the low-configure cluster. To deal with the problem, this paper provides a distributedcomputing and memorycomputing-based effective solution (Objectification Parallel computing, OPC). In the solution, the data can be formatted into object. Then the objects are distributed stored in the computer memories and parallel compute to complete tasks. The OPC is applied to the Electric Asset Quality Supervision Manage System (EAQSMS) of State Grid of China, the result shows that with PCs the system is efficiently available, reliable, and flexible expansible.
As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an Anti-TestCase-based approach to analyze th...
详细信息
ISBN:
(纸本)9780769534435
As grid software and grid applications grow in size and complexity, memory usage experiment and analysis have become more and more essential. In this paper, we investigate an Anti-TestCase-based approach to analyze the memory usage of GOS core software, and present a set of Anti-TestCases, which describe predefined memory problems of GOS core. This approach is applied with a set of automated test tools in controlled experiments including basic memory requirements, memory errors and memory usage of GOS core. With the experiment and analysis, we find several memory usage results of GOS core and they are valuable for other systems based on JVM, Tomcat and Axis. We also give some JVM memory configuration suggestions for better performance in the production server.
暂无评论