Token-passing algorithms are a common way of solving distributed mutual exclusion problems in computer networks. We list common properties of mutual exclusion problems and of token-passing algorithms, with a view towa...
详细信息
ISBN:
(纸本)9780897917377
Token-passing algorithms are a common way of solving distributed mutual exclusion problems in computer networks. We list common properties of mutual exclusion problems and of token-passing algorithms, with a view toward determining what classes of problems can be solved with what sort of tokens. In particular, we delineate when a multiset of tokens, rather than simply a set of tokens, is required. We cite a new example which shows that a mutual exclusion problem solvable in linear time and space by other means may require exponentially many tokens.
This paper analyzes the coexistence of heterogeneity and multiprogramming in parallel systems. Using simulation models, we compare the performance of cost equivalent homogeneous and heterogeneous multiprogrammed paral...
详细信息
File system∗∗ activity is a prime factor affecting the throughput of any computing system, for the file memory is, in a very real sense, the heart of the system. No program can ever be executed without such secondary ...
详细信息
A new approach to modelling software demands for computing system resources is described. The resource demand model is applicable to programs written in high level, system independent, languages. A general simulation ...
详细信息
Locality of reference in program behavior has been studied and modelled extensively because of its application to CPU, cache and virtual memory design, code optimization, multiprogramming etc. In this paper we propose...
详细信息
Although platform-independent runtime systems for parallel programming languages are desirable, the need for low-level optimizations usually precludes their existence. This is because most optimizations involve some c...
详细信息
Although platform-independent runtime systems for parallel programming languages are desirable, the need for low-level optimizations usually precludes their existence. This is because most optimizations involve some combination of low-level communication and low-level threading, the product of which is almost always platform-dependent. We propose a solution to the threading half of this dilemma by using a thread package, that allows fine-grain control over the behavior of the threads while still providing performance comparable to hand-tuned, machine-dependent thread packages. This makes it possible to construct platform-independent thread modules for parallel runtime systems and, more importantly, to optimize them.
Duplicate detection is the process of finding multiple records in a dataset that represent the same real-world entity. Due to the enormous costs of an exhaustive comparison, typical algorithms select only promising re...
详细信息
A flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design a...
详细信息
ISBN:
(纸本)0897916603
A flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design and debug process. In the Stanford FLASH multiprocessor, flexibility is obtained by requiring all transactions in a node to pass through a programmable node controller, called MAGIC. In this paper, we evaluate the performance costs of flexibility by comparing the performance of FLASH to that of an idealized hardwired machine on representative parallel applications and a multiprogramming workload. To measure the performance of FLASH, we use a detailed simulator of the FLASH and MAGIC designs, together with the code sequences that implement the cache-coherence protocol. We find that for a range of optimized parallel applications the performance differences between the idealized machine and FLASH are small For these programs, either the miss rates are small or the latency of the programmable protocol can be hidden behind the memory access time, For applications that incur a large number of remote misses or exhibit substantial hot-spotting, performance is poor for both machines, though the increased remote access latencies or the occupancy of MAGIC lead to lower performance for the flexible design, In most cases, however, FLASH is only 2%-12% T0slower than the idealized machine.
Generalized Processor Sharing (GPS) is an efficient and flexible scheduling mechanism for sharing server capacity and providing differentiated Quality-of-Service (QoS) owing to its appealing properties of fairness, tr...
详细信息
NASA Technical Reports Server (Ntrs) 20060014983: Model Checking Real Time Java Using Java Pathfinder by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 20060014983: Model Checking Real Time Java Using Java Pathfinder by NASA Technical Reports Server (Ntrs); published by
暂无评论