Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use space-sharing processor scheduling. in space-sharing, the set o...
详细信息
ISBN:
(纸本)0818684038
Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use space-sharing processor scheduling. in space-sharing, the set of processors in a system is partitioned and each partition is assigned for the exclusive use of a job. Space-sharing policies can be divided into fixed, static, or dynamic categories. For distributed-memory systems, dynamic policies incur high overhead. Thus, static policies are considered as these policies provide a better performance than the fixed policies. Several static policies have been proposed in the literature. In a previously proposed adaptive static policy, the partition size is a function of the number of queued jobs. This policy, however, tends to underutilize the system resources. To improve the performance of this policy, we propose a new policy in which the partition size is a function of the total number of jobs in the system, as opposed to only the queued jobs. The results presented here demonstrate that the new policy performs substantially better than the original policy for the various workload and system parameters. Another major contribution is the evaluation of the performance sensitivity to job structure, variances in inter-arrival times and job service times, and network topology.
Resource performance monitoring is among the most active research topics in distributed computing. In this paper, we propose an adaptive resource monitoring method for applications in heterogeneous computing environme...
详细信息
ISBN:
(纸本)9780769537474
Resource performance monitoring is among the most active research topics in distributed computing. In this paper, we propose an adaptive resource monitoring method for applications in heterogeneous computing environment. According to the operating environment of distributed heterogeneous system and the changes of system resource workload, the method combines periodic pull mode with event-driven push mode to adaptively publish and retrieve system resource information. Preliminary experiments reveal that, by using our adaptive monitoring method, the efficiency of system monitoring is improved over that accrued by using regular monitoring approaches.
This paper presents the establishment of cluster computing lab at a minority serving institution that aims to provide computing resources to support undergraduate computer science curriculum. We present a case study o...
详细信息
The paper considers the problem of constructing a planer orthogonal grid drawing (or more simply, layout) of an n-vertex graph, with the goal of minimizing the number of bends along the edges. It exhibits graphs that ...
详细信息
An important development in cluster computing is the availability of multiprocessor workstations. These are able to provide additional computational power to the cluster without increasing network overhead, and allow ...
详细信息
ISBN:
(纸本)0818681187
An important development in cluster computing is the availability of multiprocessor workstations. These are able to provide additional computational power to the cluster without increasing network overhead, and allow multiparadigm parallelism, which we define to be the simultaneous application of both distributed and shared memory parallelprocessing techniques to a single problem. In this paper we compare execution times and speedup of parallel programs written in a pure message-passing paradigm with those that combine message passing and shared-memory primitives in the same application. We consider three basic applications that are common building blocks for many scientific and engineering problems: numerical integration, matrix multiplication and Jacobi iteration. Our results indicate that the added complexity of combining shared- and distributed-memory programming methods in the same program doe snot contribute sufficiently to performance to justify the added programming complexity.
Dependability analysis of a large network is NP-hard due to the state space explosion. A hierarchical Boolean algebraic method was recently introduced to efficiently evaluate static terminal reliability and task-based...
详细信息
ISBN:
(纸本)081864222X
Dependability analysis of a large network is NP-hard due to the state space explosion. A hierarchical Boolean algebraic method was recently introduced to efficiently evaluate static terminal reliability and task-based reliability by dividing the problem into smaller, more manageable pieces. We extend this method to evaluate time-dependent reliability and availability, collectively referred to as `dependability', and to approximate MTTF.
Lattice basis reduction has important applications in the areas of computer algebra, cryptography and combinatorial optimization. Several efficient sequential algorithms are known. Recently, parallel algorithms have b...
详细信息
ISBN:
(纸本)081864222X
Lattice basis reduction has important applications in the areas of computer algebra, cryptography and combinatorial optimization. Several efficient sequential algorithms are known. Recently, parallel algorithms have been developed but until now a formal proof for the efficiency of parallel algorithms with n2 processors has been omitted, where n denotes the dimension of the lattice. In this paper, a variant of the well-known basis reduction algorithms is presented that is well suited for the computation with fast floating point arithmetic and for the implementation on a mesh-connected array of n2 processors. In addition, an error analysis and a proof of the parallel efficiency is provided.
SystemC has become a very popular standardized language for the modeling of System-On-Chip (SoC) devices. However, due to the ever increasing complexity of SoC designs, the ever longer simulation times affect SoC expl...
详细信息
ISBN:
(纸本)9780769534718
SystemC has become a very popular standardized language for the modeling of System-On-Chip (SoC) devices. However, due to the ever increasing complexity of SoC designs, the ever longer simulation times affect SoC exploration potential and time-to-market. In order to reduce these times, we have developed a parallel System C kernel. Because the System C semantics require a high level of synchronization which can dramatically affect the performance, we investigate in this paper some ways to reduce the synchronization overheads. We validate then our approaches against an academic design model and a real, industrial application.
As parallel computers are increasingly used to run scientific applications with large data sets, and as processor speeds continue to increase, it becomes more important to provide fast, effective parallel file systems...
详细信息
As parallel computers are increasingly used to run scientific applications with large data sets, and as processor speeds continue to increase, it becomes more important to provide fast, effective parallel file systems for data storage and for temporary files. In an earlier work we demonstrated that a technique we call disk-directed I/O has the potential to provide consistent high performance for large, collective, structured I/O requests. In this paper we expand on this potential by demonstrating the ability of a disk-directed I/O system to read irregular subsets of data from a file, and to filter and distribute incoming data according to data-dependent functions.
Common Language Infrastructure, or CLI, is a standardized virtual machine, which increasingly becomes popular on a wide range of platforms. In this paper we developed three I/O-intensive benchmarks for the CLI using v...
详细信息
ISBN:
(纸本)0769523129
Common Language Infrastructure, or CLI, is a standardized virtual machine, which increasingly becomes popular on a wide range of platforms. In this paper we developed three I/O-intensive benchmarks for the CLI using various techniques. The first benchmark is designed in accordance with an application behavioural model that rebuilds the behavior of real world I/O-intensive applications. The second benchmark is a trace driven simulator that simulates five I/O-intensive applications. The third benchmark is a micro I/O-Intensive benchmark used to emulate a simple web server. In addition, the performances of the benchmarks are evaluated on the SSCLI. The results suggest that the CLI is a potential virtual machine for I/O-intensive computing.
暂无评论