检索结果-内蒙古大学图书馆

Proceedings of the 5th IEEE international symposium on High Performance distributed computing

作者： W. B.,. Iii Ligon R. B. Ross

ISBN: (纸本)9780818675829

Dedicated cluster parallel computers (DCPCs) are emerging as low-cost high performance environments for many important applications in science and engineering. A significant class of applications that perform well on a DCPC are coarse-grain applications that involve large amounts of file I/O. Current research in parallel file systems for distributed systems is providing a mechanism for adapting these applications to the DCPC environment. We present the Parallel Virtual File System (PVFS), a system that provides disk striping across multiple nodes in a distributed parallel computer and file partitioning among tasks in a parallel program. PVFS is unique among similar systems in that it uses a stream-based approach that represents each file access with a single set of request parameters and decouples the number of network messages from details of the file striping and partitioning. PVFS also provides support for efficient collective file accesses and allows overlapping file partitions. We present results of early performance experiments that show PVFS achieves excellent speedups in accessing moderately sized file segments.

关键词： PVFS

来源：评论

学校读者我要写书评

暂无评论

Telegraphos: high-performance networking for parallel processing on workstation clusters

Telegraphos: high-performance networking for parallel proces...

引用

IEEE symposium on High-Performance Computer Architecture

作者： E.P. Markatos M.G.H. Katevenis Computer Architecture and VLSI Systems Group Institute of Computer Science (ICS) Foundation for Research and Technology Hellas Crete Greece

Networks of workstations and high-performance microcomputers have been rarely used for running high-performance applications like multimedia, simulations, scientific and engineering applications, because, although they have significant aggregate computing power, they lack the support for efficient message-passing and shared-memory communication. In this paper we present Telegraphos, a distributed system that provides efficient shared-memory support on top of a workstation cluster. We focus on the network interface of Telegraphos that provides a variety of shared-memory operations like remote reads, remote writes, remote atomic operations, all launched from user level without any intervention of the operating system. Telegraphos I, the first Telegraphos prototype has been implemented. Emphasis was put on rapid prototyping, so the technology used was conservative: FPGA's, SRAM's, and TTL buffers. Telegraphos II, is the single-chip version of the Telegraphos architecture; its switch was implemented and its network interface is being debugged.

关键词： Parallel processing Workstations Network interfaces Prototypes Switches Microcomputers Multimedia computing Computational modeling Power engineering and energy Aggregates

来源：评论

学校读者我要写书评

暂无评论

Vista: a framework for instrumentation system design for multidisciplinary applications

Vista: a framework for instrumentation system design for mul...

引用

international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： A. Waheed D.T. Rover M. Mutka A. Bakic D. Pierce Departments of Electrical Engineering and Computer Science Michigan State University East Lansing MI USA

This paper presents a framework, called Vista, for designing instrumentation systems (ISs) for various applications that use distributed computing systems. We define an instrumentation system as a collection of modules and functions used for collecting data from concurrent processes executed on various nodes across the network. Based on our generic model of an IS, the Vista framework provides various abstract and base classes that help a user to quickly configure an IS for a particular application domain. Vista library is built on top of various operating system services to provide various convenience functions to collect and forward the instrumentation data. The design of this framework is hierarchical to address diverse user needs. We present the application of this framework to various practical data collection and management problems.

关键词： Instruments Application software distributed computing Real time systems Performance analysis Operating systems Runtime Debugging Animation Monitoring

来源：评论

学校读者我要写书评

暂无评论

THE QOS BROKER

引用

IEEE MULTIMEDIA 1995年第1期2卷 53-67页

作者： NAHRSTEDT, K SMITH, JM UNIV PENN DEPT COMP & INFORMAT SCIPHILADELPHIAPA 19104

In human affairs, brokers are intermediaries with specialized knowledge who work toward a mutually desirable outcome through negotiation. The QOS Broker is a software engineering technique that uses this principle to arrange for the delivery of end-to-end quality of service in distributed multimedia systems. An experimental prototype using a telerobotics application helped identify the technique's limitations and system requirements.

关键词： Quality Of Service Scheduling Real Time Communications And Services Remote Control applications Software Architecture For Multimedia

来源：评论

学校读者我要写书评

暂无评论

Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer 1

Implementing a 3D multigrid algorithm on Fujitsu's vector pa...

引用

1st Aizu international symposium on Parallel Algorithms/Architecture Synthesis, AISPAS 1995

作者： Wang, I. Lung, H. Katsumata, Y. Ishigai, T. Scientific and Engineering Applications Fujitsu Systenis Business of America Inc. Santa ClaraCA95054 United States Computational Engineering Applications Supercomputer Systems Department Science Systems Division Fujitsu Limited Chiba261 Japan

ISBN: (纸本)081867038X

Multigrid algorithms are well adopted by many engineering applications programs on the traditional sequential computers due to their good convergence behavior. In order to convert those existing resources to the field of parallel computing in a timely manner, an effective parallelization methodology should be set up to ease the conversion efforts and to take advantage of the power of parallel processing at the same time. We demonstrate how domain decomposition can be applied to the multigrid algorithm by means of a simple three-dimensional problem which is solved by a V-cycle scheme. The sequential code in FORTRAN provided by NASA NAS, known as the NAS multigrid parallel benchmark test, is being used in our current study. We have concluded that the parallelization methodology presented here would greatly reduce conversion efforts in the process of parallelization and would obtain very good performance and scalability on the Fujitsu's VPP500 computers. Fujiisa's VPP500 uses Fujitsu's well-known vector supercomputer as its processing element (PE) each rated at 1.6 GFLOPS. Also, the highly efficient crossbar network serves as the inter-PE highway has been rated at 800 MB/s. Both technologies have been implemented an Fujatsu's products and widely accepted in ihe supercomputing industry for decades. Fujitsu's VPP Fortran compiler also gives us much flexibility in the parallelizalion and provides a smooth conversion environment for this research. © 1995 IEEE.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

FIAT - Fault injection based automated testing environment

FIAT - Fault injection based automated testing environment

引用

international symposium on Fault-Tolerant computing (FTCS)

作者： Z. Segall D. Vrsalovic D. Siewiorek D. Ysskin J. Kownacki J. Barton R. Dancey A. Robinson T. Lin Department of Computer Science Carnegie Mellon University Pittsburgh PA USA Systemmechnology Development Corporation Reston VA USA Federal Systems Division International Business Machines Corporation Rockville MD USA

distributed/parallel real-time dependable systems employed in critical applications such as avionics, air traffic control and nuclear power plants need property validation during design. implementation. deployment and maintenance phases. There is a distinct challenge to validate dependability properties of such systems. An automated real-time distributed accelerated fault injection environment (FIAT) is presented as an attempt to provide suitable tools for the validation process. This paper presents the concepts and design, as well as the implementation and evaluation of the FIAT environment. As this system has been built, evaluated and is currently in use, example fault tolerant systems such as checkpointing and duplicate and match will be employed to show its usefulness.

关键词： Automatic testing Circuit faults Hardware Real time systems Predictive models NASA Acceleration Fault tolerant systems Fault detection Solid state circuit design

来源：评论

学校读者我要写书评

暂无评论

Implementing a 3D multigrid algorithm on Fujitsu's vector parallel supercomputer

Implementing a 3D multigrid algorithm on Fujitsu's vector pa...

引用

Aizu international symposium on Parallel Algorithms/Architecture Synthesis

作者： J. Wang H. Lung Y. Katsumata T. Ishigai Scientific and Engineering Applications Fujitsu Systenis Business of America Inc. Santa Clara CA USA Computational Engineering Applications Supercomputer Systems Department Science Systems Division Fujitsu Laboratories Limited Chiba Japan

关键词： Parallel processing Power engineering and energy Application software Power engineering computing Convergence NASA Benchmark testing Sequential analysis Scalability Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Multi-level partitioning and scheduling under local memory constraint

Multi-level partitioning and scheduling under local memory c...

引用

international symposium on Parallel and distributed Processing (IPDPS)

作者： Qingyan Wang N.L. Passos E.H. Sha Department of Computer Science & Engineering University of Notre Dame Notre Dame IN USA Computer Science & Engineering University of Notre Dame Notre Dame IN USA

Massive uniform nested loops are broadly used in scientific and DSP applications. Due to the large amount of data handled by such applications the optimization of data accesses by fully utilizing the local memory and minimizing communication overhead is important in order to improve the overall system performance. Most of the traditional partition strategies do not consider the effect of data access on the computational performance. In this study, multilevel partitioning method based on a static data scheduling technique known as carrot-hole data scheduling, is proposed to control the data traffic between different levels of memory. Based on this data schedule, optimal partition vector scheduling vector and the partition size are chosen in such a way to minimize communication overhead. Non-homogeneous size partitions are the final result of the partition scheme which produces a significant performance improvement. Experiments show that by using this technique local cache misses are significantly reduced as compared to results obtained from traditional methods.

关键词： Memory management Processor scheduling System performance Digital signal processing Application software Satellites Shape Computer science Communication system control Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Metrics and techniques for automatic partitioning and assignment of object-based concurrent programs

Metrics and techniques for automatic partitioning and assign...

引用

international symposium on Parallel and distributed Processing (IPDPS)

作者： L.R. Welch B. Ravindran J. Henriques D.K. Hammer Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA Mathematics and Computer Science Department Eindhovan University of Technology Eindhoven Netherlands

The software crises is defined as the inability to meet the demands for new software systems, due to the slow rate at which systems can be developed. To address the crisis, object-based design and implementation techniques and domain models have been developed. However, object-based techniques do not address an additional problem that plagues systems engineers-the effective utilization of distributed and parallel hardware platforms. This problem is partly addressed by program partitioning languages that allow engineers to specify how software components should be partitioned and assigned to the nodes of concurrent computers. However, very little has been done to automate the tasks of partitioning and assignment at the task and object level of granularity. Thus, this paper describes automated techniques for distributed/parallel configuration of object-based applications, and demonstrates the technique on Ada programs. The granularity of partitioning is at the level of the Ada program unit (a program unit is an object, a class, a task, a package (possibly a generic template) or a subprogram). The partitioning is performed by constructing a call-rendezvous graph (CRG) for an application program. The nodes of the graph represent the program units, and the edges denote call and task interaction/rendezvous relationships. The CRG is augmented with edge weights depicting inter-program-unit communication relationships and concurrency relationships, resulting in a weighted CRG (WCRC). The partitioning algorithm repeatedly "cuts" edges of the WCRG with the goal of producing a set of partitions among which (1) there is a small amount of communication and (2) there is a large degree of potential for concurrent execution. Following the partitioning of the WCRG into tightly coupled clusters, a random neural network is employed to assign clusters to physical processors.

关键词： Concurrent computing Software systems Hardware Systems engineering and theory Packaging distributed computing Clustering algorithms Partitioning algorithms Neural networks Computer science

来源：评论

学校读者我要写书评

暂无评论

Time-optimal message-efficient work performance in the presence of faults 94

Time-optimal message-efficient work performance in the prese...

引用

Proceedings of the 13th Annual ACM symposium on Principles of distributed computing

作者： De, Prisco, Roberto Mayer, Alain Yung, Moti Dept. of Computer Science Columbia University New York NY and Dipartimento di Informatica ed Applicazioni Università di Salerno 84081 Baronissi (SA) Italy Dept. of Computer Science Columbia University New York NY IBM Research Division T.J. Watson Research Center Yorktown Heights NY

ISBN: (纸本)9780897916547

Performing work in parallel by a multitude of processes in a distributed environment is currently a fast growing area of computer applications (due to its cost effectiveness). Adaptation of such applications to changes in system's parallelism (i.e., the availability of processes) is essential for improved performance and reliability. In this work we consider one aspect of coping with dynamic processes failures in such a setting, namely the following scenario formulated by Dwork, Halpern and Waarts [DHW92]: a system of n synchronous processes that communicate only by sending messages to one another. These processes must perform m independent units of work. Processes may fail by crashing and wait-freeness is required, i.e. that whenever at least one process survives, all m units of work will be performed. We consider the notion of fast algorithms in this setting, yet we are not willing to trade improved time for a high cost in communication. Thus, we require message efficiency as well. We therefore put forth the notion of lexicographic efficiency, that is we consider the following two complexity measures in order: The parallel processor step (or S for short) as introduced by Kanellakis and Shvartsman [KS89] in the context of robust PRAM and the number of messages sent (denoted M). © 1994 ACM.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：