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

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Grosspietsch, Karl-Erwin Silayeva, Tanya A. Fraunhofer Inst. Autonomous I.S. D-53754 St. Augustin Germany Moscow Aviation Institute Volokolamsk Highway 4 125871 Moscow Russia

ISBN: (纸本)0769521320

Actually, there is growing consensus that for many system applications, safety as well as security demands have to be observed in a coherent manner. In this paper we describe an integrated approach to protect the nodes of distributed co-operative systems against malicious attacks and unplanned system failures. the basic strategy is the use of special diagnostic agents for that purpose. this agent concept is supported by means of additional diagnostic units modularly added to the processor/memory interface of each node of the system. these units have their own autonomous control which cannot be altered by their corresponding processor. Each instruction transferred to the processor, and each data word transferred to/from the processor, in a side step can be scanned by the diagnosis unit. In case of a suspicion for malicious or non-malicious faults, the diagnosis unit can take over control of the corresponding processor to run diagnostic routines, and can trigger recovery procedures to restore a proper state of the processor of the node. the resulting impact on system reliability is derived;here a reliability modelling approach is discussed to describe especially malicious intrusion faults in a more refined way, by distinguishing different classes of attackers. the resulting reliability of the presented architecture is sketched.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

IQ-services: Resource-aware middleware for heterogeneous applications

IQ-services: Resource-aware middleware for heterogeneous app...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Cai, Zhongtang Eisenhauer, Greg Poellabauer, Christian Schwan, Karsten Wolf, Matthew College of Computing Georgia Institute of Technology

ISBN: (纸本)0769521320

Heterogeneous computing platforms constitute a challenging execution environment for distributed applications. this paper presents a 'systems' view of effective platform usage, by demonstrating the need for application software to be continuously 'aware' of the resources currently available on their underlying heterogeneous computing platforms. Our approach to the implementation of resource awareness is one that (1) provides a 'thin' middleware layer of resource aware services that permit applications to react to changes in resource availability and resources to be managed in accordance with application needs, and that (2) develops compiler- and application-level techniques for dynamic 'service morphing', the goal being to make it easy for application-level services to adjust to runtime changes in application needs or in platform resources. the specific results presented in this paper are focused on large-data applications, for which the IQ-Services 'morphing' layer implements the data manipulations necessary to permit wide-area interactive or multimedia applications to proceed smoothly despite variations in underlying computing and network resources. IQ-Services interact with the systems layer via dynamic performance attributes, and end-to-end implementations of such attributes also enable clients to interact with servers. this results in a cooperative approach to data management for the large-data applications targeted by our research, We present and experiment with sample IQ-Services implemented for a wide-area collaboration in which multiple end users utilize different graphical views of the data being produced by a scientific simulation. the testbed used in experiments is comprised of high end machines connected via a local area backbone, remote machines connected via the Internet, and 'home' machines connected via a DSL link. Experimental results demonstrate substantial performance improvements attained by coordinating network-level with service-level adaptati

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Extended Abstract)

Fast shared-memory algorithms for computing the minimum span...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Bader, David A. Cong, Guojing Electrical Engineering Department University of New Mexico Albuquerque NM 87131

ISBN: (纸本)0769521320

Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such as cancer detection, medical imaging, and proteomics, and national security and bioterrorism such as detecting the spread of toxins through populations in the case of biological/chemical warfare. Most of the previous attempts for improving the speed of MST using parallel computing are too complicated to implement or perform well only on special graphs with regular structure. In this paper we design and implement four parallel MST algorithms (three variations of Borůvka plus our new approach) for arbitrary sparse graphs that for the first time give speedup when compared with the best sequential algorithm. In fact, our algorithms also solve the minimum spanning forest problem. We provide an experimental study of our algorithms on symmetric multiprocessors such as IBM's p690/Regatta and Sun's Enterprise servers. Our new implementation achieves good speedups ever a wide range of input graphs with regular and irregular structures, including the graphs used by previous parallel MST studies. For example, on an arbitrary random graph with 1M vertices and 20M edges, our new approach achieves a speedup of 5 using 8 processors. the source code for these algorithms is freely-available from our web site ***.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Assignment and scheduling of real-time DSP applications for heterogeneous functional units

Assignment and scheduling of real-time DSP applications for ...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Shao, Zili Zhuge, Qingfeng He, Yi Xue, Chun Liu, Meilin Sha, Edwin H.-M. Department of Computer Science University of Texas at Dallas Richardson TX 75083 United States

ISBN: (纸本)0769521320

In high level synthesis for real-time digital signal processing (DSP) architectures using heterogeneous functional units (FUs), an important problem is how to assign a proper FU type to each operation of a DSP application and generate a schedule in such a way that all requirements can be met and the total cost can be minimized. In this paper, we propose a two-phase approach to solve this problem. In the first phase, we solve heterogeneous assignment problem, i.e., how to assign a proper FU type to a DSP application such that the total cost can be minimized while the timing constraint is satisfied. In the second phase, based on the assignments obtained from the first phase, we propose a minimum resource scheduling algorithm to generate a schedule and a feasible configuration that uses as little resource as possible. We prove heterogeneous assignment problem is NP-complete and propose several algorithms to solve it. the experiments show that Algorithm DFG_Assign_Repeat is the best that gives a reduction of 25.7% on total cost compared with the previous work.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

parallel brutus: the first distributed, FPGA accelerated chess program

Parallel brutus: The first distributed, FPGA accelerated che...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Donninger, Chrilly Kure, Alex Lorenz, Ulf University of Paderborn Fac. Comp. Sci. Elec. Eng./Math. Fürstenallee 11 D-33102 Paderborn

ISBN: (纸本)0769521320

In times when the FPGA technology has reached maturity such that complex designs are possible, the boarder between hard- and software vanishes. It is now possible to develop fine grained parallel applications without the long-lasting chip design cycles. Simultanously, by the help of message passing libraries like MPI it is easy to write coarse grained parallel applications. the chess program Brutus is a high level application which profits from both worlds. When playing board games like chess, checkers, othello etc., computers use game tree search algorithms to evaluate a position. the most spectacular success of a game playing program so far, has been the victory of the chess machine 'Deep Blue' vs. G. Kasparov, the best human chess player in the world, at that time. the world has now reached the point that a chess program can not only win one match against a human top player, but they are just getting stronger than the best human players. We describe the design philosophy, general architecture and performance of the chess program Brutus, which has just won an international Grandmaster Tournament with seven wins and 4 draws. Brutus is split up in a hardware-and software engine. the hardware (indeed in FPGA simulated hardware) calculates the time critical part of the search tree near the leaves. the part near the root is done in software, where it is much easier to to develop sophisticated algorithms. the FPGA cards allows the implementation of sophisticated chess knowledge without decreasing the computational speed. thus, Brutus follows its famous predecessors Belle and Deep Blue.

关键词： Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

parallel mining of association rules from text databases on a cluster of workstations

Parallel mining of association rules from text databases on ...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Holt, John D. Chung, Soon M. Dept. of Comp. Sci. and Engineering Wright State University Dayton OH 45435 United States

ISBN: (纸本)0769521320

In this paper, we propose a new algorithm named parallel Multipass with Inverted Hashing and Pruning (PMIHP) for mining association rules between words in text databases. the characteristics of text databases are quite different from those of retail transaction databases, and existing mining algorithms cannot handle text databases efficiently because of the large number of itemsets (i.e., sets of words) that need to be counted. the new PMIHP algorithm is a parallel version of our Multipass with Inverted Hashing and Pruning (MIHP) algorithm [13], which was shown to be quite efficient than other existing algorithms in the context of mining text databases. the PMIHP algorithm reduces the overhead of communication between miners running on different processors because they are mining local databases asynchronously and prune the global candidates by using the Inverted Hashing and Pruning technique. Compared with the well-known Count Distribution algorithm [2], PMIHP demonstrates superior performance characteristics for mining association rules in large text databases, and when the minimum support level is low, its speedup is superlinear as the number of processors increases. these experiments were performed on a cluster of Linux workstations using a collection of Wall Street Journal articles.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

D-CAT: An efficient algorithm for distributed channel allocation in cellular mobile networks

引用

MOBILE NETWORKS & applications 2004年第4期9卷 279-288页

作者： Zhang, YB Das, SK Jia, XH Univ Tsukuba Inst Policy & Planning Sci Tsukuba Ibaraki 3058573 Japan Univ Texas Dept Comp Sci & Engn Arlington TX 76019 USA City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

We propose a distributed channel allocation algorithm based on a threshold scheme, called D-CAT, for cellular mobile networks. the algorithm employs two thresholds: (i) a heavy threshold for determining whether a cell is heavy, or overloaded, and for triggering the channel allocation algorithm;and (ii) a target threshold for indicating the target number of free channels that a heavy cell intends to acquire. Based on the two-threshold scheme, the D-CAT algorithm can determine the optimal number of free channels as well as the cell(s) from where a heavy cell should import channels in order to satisfy the required channel demand. Simulation experiments and analyses show that the proposed algorithm incurs lower overhead for channel allocation and is more efficient in terms of channel utilization than other distributed channel allocation algorithms. It also outperforms other centralized and distributed algorithms in terms of call blocking probability.

关键词： distributed channel allocation channel importing and exporting heavy threshold target threshold mobile communication

来源：评论

学校读者我要写书评

暂无评论

Performance characteristics of the multi-zone NAS parallel benchmarks

Performance characteristics of the multi-zone NAS parallel b...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Jin, Haoqiang Van Der Wijngaart, Rob F. NASA Adv. Supercomputing Division M/S T27A-1 NASA Ames Research Center Moffett Field CA 94035-1000 Computer Sciences Corporation

ISBN: (纸本)0769521320

We describe a new suite of computational benchmarks that models applications featuring multiple levels of parallelism. Such parallelism is often available in realistic flow computations on systems of meshes, but had not previously been captured in benchmarks. the new suite, named NPB (NAS parallel Benchmarks) Multi-Zone, is extended from the NPB suite, and involves solving the application benchmarks LU, BT and SP on collections of loosely coupled discretization meshes. the solutions on the meshes are updated independently, but after each time step they exchange boundary value information. this strategy provides relatively easily exploitable coarse-grain parallelism between meshes. three reference implementations are available: one serial, one hybrid using the Message Passing Interface (MPI) and OpenMP, and another hybrid using a shared memory multi-level programming model (SMP+OpenMP). We examine the effectiveness of hybrid parallelization paradigms in these implementations on three different parallel computers. We also use an empirical formula to investigate the performance characteristics of the hybrid parallel codes.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

D-CAT: An efficient algorithm for distributed channel allocation in cellular mobile networks

D-CAT: An efficient algorithm for distributed channel alloca...

引用

15th ieee international parallel and distributed processing symposium (IPDPS 01)

关键词： distributed channel allocation channel importing and exporting heavy threshold target threshold mobile communication

来源：评论

学校读者我要写书评

暂无评论

Adapting to memory pressure from within scientific applications on multiprogrammed COWs

Adapting to memory pressure from within scientific applicati...

引用

Proceedings - 18th international parallel and distributed processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Mills, Richard T. Stathopoulos, Andreas Nikolopoulos, Dimitrios S. Department of Computer Science College of William and Mary Williamsburg VA 23187-8795

ISBN: (纸本)0769521320

Dismal performance often results when the memory requirements of a process exceed the physical memory available to it. Moreover, significant throughput reduction is experienced when this process is part of a synchronous parallel job on a non-dedicated computational cluster. A possible solution is to develop programs that can dynamically adapt their memory usage according to the current availability of physical memory. We explore this idea on scientific computations that perform repetitive data accesses. Part of the program's data set is cached in resident memory, while the remainder that cannot fit is accessed in an "out-of-core" fashion from disk. the replacement policy can be user defined. this allows for a graceful degradation of performance as memory becomes scarce. To dynamically adjust its memory usage, the program must reliably answer whether there is a memory shortage or surplus in ihe system. Because operating systems typically export limited memory information, we develop a parameter-free algorithm that uses no system information beyond the resident net size (RSS) of the program. Our resulting library can be called by scientific codes with little change to their structure or with no change at all, if computations are already "blocked" for reasons of locality. Experimental results with both sequential and parallel versions of a memory-adaptive conjugate-gradient linear system solver show substantial performance gains over the original version that relies on the virtual memory system. Furthermore, multiple instances of the adaptive code can coexist on the same node with little interference with one another.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：