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

PERFORMANCE EVALUATION OF SELF-TIMED data-flow ON THE IPSC-2 HYPERCUBE

INTERNATIONAL JOURNAL OF ELECTRONICS 1995年第1期78卷 1-18页

作者： ALMOUHAMED, M BIC, L UNIV CALIF IRVINE DEPT INFORMAT & COMP SCIIRVINECA 92717

An approach for efficient execution of real-time computations (macro-dataflow) based on exploiting compile-time knowledge of computation and communication is proposed for the Intel iPSC-2 distributed-memory multiprocessor. The method is useful for synchronous dataflow computations that have predictable dataflow behaviour. To reduce the run-time overhead, it is proposed to generate self-timed processor assignments based on estimating the execution and communication times and the use of a simplified model of packet exchange between the processors. At run-time, each processor executes an ordered list of computation and communication functions so that only the start is left to be decided at run-time. To further reduce the run-time overhead, each processor runs a local manager program to handle the arrival and storage of remote data in an optimized manner. The execution method does not restrict the communication order and allows remote data be received during task execution. Experimental evaluation of the iPSC-2 distributed-memory hypercube shows that: self-timed execution allows significant reduction of run-time overhead;and the predicted and run-time speed-up match at the 10% level when the ratio of communication to computation times (granularity) is below 18% for the iPSC-2. Stochastic testing shows that gross estimation of the computation parameters (within 30% error) leads to moderate degradation of potential speed-up, and degradation decreases with increasing problem size.

关键词： MULTIPROCESSORS DISTRIBUTED computing data flow computing

来源：评论

学校读者我要写书评

暂无评论

data cache and direct memory access in programming mediaprocessors

引用

IEEE MICRO 2001年第4期21卷 33-42页

作者： Kim, D Managuli, R Kim, Y Univ Washington Dept Elect Engn Seattle WA 98195 USA Univ Washington Dept Bioengn Seattle WA 98195 USA

Mediaprocessors provide high performance by using both instruction- and data-level parallelism. Because of the increased computing power, transferring data between off- and on-chip memories without slowing down the core processor's performance is challenging. Two methods, data cache and direct memory access, address this problem in different ways.

关键词： CACHE memory MICROPROCESSORS data flow computing

来源：评论

学校读者我要写书评

暂无评论

Design of collaboration framework for distributed CIM data activities

引用

IIE TRANSACTIONS 2001年第7期33卷 535-546页

作者： Kim, CO Nof, SY Myong Ji Univ Dept Ind Engn Yongin 449728 Kyungki Do South Korea Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA

Together with the development of computer network technology, the automatic collaboration of CIM data activities is becoming an important research issue. Two models are proposed for the research issue: a data activity flow network model called DAF-Net for coordinating interdependent data activities and an agent-based integration model of information systems called AIMIS for integrating distributed and heterogeneous information systems on demand. Additionally, this paper addresses the key design factors of the DAF-Net and also the AIMIS: the structural type of the DAF-Net and the agent interaction protocol of the AIMIS. Statistical methods and PVM (Parallel Virtual Machine) software are employed for the design of the DAF-Net and the AIMIS.

关键词： Computer integrated manufacturing systems Information resources management data flow computing

来源：评论

学校读者我要写书评

暂无评论

data flow Algorithms for Processors with Vector Extensions

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2017年第1期87卷 21-31页

作者： Barford, Lee Bhattacharyya, Shuvra S. Liu, Yanzhou Keysight Technol Inc Keysight Labs 561 Keystone Ave Unit 434 Reno NV 89503 USA Univ Maryland College Pk MD 20742 USA Tampere Univ Technol Tampere Finland

Full use of the parallel computation capabilities of present and expected CPUs and GPUs requires use of vector extensions. Yet many actors in data flow systems for digital signal processing have internal state (or, equivalently, an edge that loops from the actor back to itself) that impose serial dependencies between actor invocations that make vectorizing across actor invocations impossible. Ideally, issues of inter-thread coordination required by serial data dependencies should be handled by code written by parallel programming experts that is separate from code specifying signal processing operations. The purpose of this paper is to present one approach for so doing in the case of actors that maintain state. We propose a methodology for using the parallel scan (also known as prefix sum) pattern to create algorithms for multiple simultaneous invocations of such an actor that results in vectorizable code. Two examples of applying this methodology are given: (1) infinite impulse response filters and (2) finite state machines. The correctness and performance of the resulting IIR filters and one class of FSMs are studied.

关键词： Digital signal processing data flow computing Vector processors Parallel algorithms Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

A data flow TECHNIQUE FOR THE EFFICIENT DESIGN OF A CLASS OF PARALLEL NON-data flow SIGNAL PROCESSORS

引用

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1990年第12期38卷 2162-2173页

作者： THALER, M MOSCHYTZ, GS SWISS FED INST TECHNOL INST SIGNAL & INFORMAT PROCCH-8092 ZURICHSWITZERLAND

A system called net optimization and resource allocation (NORA) is introduced for the evaluation and programming of parallel signal processors, based on a data flow representation of the signal processing application. The main feature of this approach is that the scheduling and resource allocation can be done at compile time. It is made possible by the fact that most signal processing algorithms have constant data flow. The resulting hardware is much simpler because no overhead is needed for the real-time scheduling, as in usual data flow systems. Therefore a realization can easily be obtained using either commercially available components or VLSI technology. The proposed system comprises four main components: (1) a vector oriented data flow compiler for the translation of a high-level language description of algorithms into a data flow graph; (2) a critical path analysis for the evaluation of the minimal computation time of the algorithm, where block scheduling is assumed; (3) a schedule optimization for the determination of the minimal computation time under limited resources, not taking into account limitations imposed by the interconnection structure and temporary storage; and (4) a combined schedule optimization and resource allocation that maps a signal processing application onto a given hardware configuration and generates a formal microprogram.< >

关键词： Signal processing algorithms Optimal scheduling Processor scheduling data flow computing Resource management Hardware flow graphs Scheduling algorithm Optimizing compilers Parallel programming

来源：评论

学校读者我要写书评

暂无评论

GENERATING COMPACT CODE FROM data-flow SPECIFICATIONS OF MULTIRATE SIGNAL-PROCESSING ALGORITHMS

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS 1995年第3期42卷 138-150页

作者： BHATTACHARYYA, SS BUCK, JT HA, SH LEE, EA UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCIBERKELEYCA 94720

Synchronous dataflow (SDF) semantics are well-suited to representing and compiling multirate signal processing algorithms. A key to this match is the ability to cleanly express iteration without overspecifying the execution order of computations, thereby allowing efficient schedules to be constructed. Due to limited program memory, it is often desirable to translate the iteration in an SDF graph into groups of repetitive firing patterns so that loops can be constructed in the target code. This paper establishes fundamental topological relationships between iteration and looping in SDF graphs, and presents a scheduling framework that provably synthesizes the most compact looping structures for a large class of practical SDF graphs. By modularizing different components of the scheduling framework, and establishing their independence, we show how other scheduling objectives, such as minimizing data buffering requirements or increasing the number of data transfers that occur in registers, can be incorporated in a manner that does not conflict with the goal of code compactness.

关键词： concurrency control data flow computing data flow graphs iterative methods parallel algorithms scheduling signal processing SDF graph code compactness data buffering requirements dataflow specifications directed graphs iteration looping multirate signal directed graphs Parallel algorithms program store unit data flow graphs Concurrency control signal processing data flow Loops iterative methods

来源：评论

学校读者我要写书评

暂无评论

OVERVIEW OF THE SOFTWARE ARCHITECTURE AND data flow FOR THE J-PET TOMOGRAPHY DEVICE

引用

ACTA PHYSICA POLONICA B 2016年第2期47卷 561-567页

作者： Krzemien, W. Alfs, D. Bialas, P. Czerwinski, E. Gajos, A. Glowacz, B. Jasinska, B. Kaminska, D. Korcyl, G. Kowalski, P. Kozik, T. Kubicz, E. Niedzwiecki, Sz. Pawlik-Niedzwiecka, M. Raczynski, L. Rudy, Z. Silarski, M. Strzelecki, A. Wieczorek, A. Wislicki, W. Zielinski, M. Moskal, P. Natl Ctr Nucl Res High Energy Phys Div PL-05400 Otwock Poland Jagiellonian Univ Fac Phys Astron & Appl Comp Sci PL-30348 Krakow Poland Marie Curie Sklodowska Univ Inst Phys Dept Nucl Methods PL-20031 Lublin Poland Natl Ctr Nucl Res Swierk Comp Ctr PL-05400 Otwock Poland Polish Acad Sci Inst Met & Mat Sci PL-30059 Krakow Poland

Modern TOF-PET scanner systems require high-speed computing resources for efficient data processing, monitoring and image reconstruction. In this article, we present the data flow and software architecture for the novel TOF-PET scanner developed by the J-PET Collaboration. We discuss the data acquisition system, reconstruction framework and image reconstruction software. Also, the concept of computing outside hospitals in the remote centers such as Swierk computing Centre in Poland is presented.

关键词： SCANNING systems RESEARCH IMAGING systems INFORMATION storage & retrieval systems IMAGE reconstruction data flow computing

来源：评论

学校读者我要写书评

暂无评论

Retiming synchronous data-flow graphs to reduce execution time

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2001年第10期49卷 2397-2407页

作者： O'Neil, TW Sha, EHM Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA Univ Texas Sch Engn & Comp Sci Richardson TX 75083 USA

Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to equivalent DFGs with smaller clock periods, the use of retiming for attempting to reduce the execution time of synchronous DFGs has never been explored. In this paper, we do just this. We develop the basic definitions and results necessary to expres and study SDFGs. We review the problems faced when attempting to retime an SDFG in order to minimize clock period and then present algorithms for doing this. Finally, we demonstrate the effectiveness of our methods on several examples.

关键词： ONLINE data processing data flow computing SYNCHRONOUS data transmission systems

来源：评论

学校读者我要写书评

暂无评论

A DISTRIBUTION-SYSTEM OUTAGE DISPATCH BY data-BASE METHOD WITH REAL-TIME REVISION

引用

IEEE TRANSACTIONS ON POWER DELIVERY 1989年第1期4卷 515-523页

作者： LIN, CE HUANG, YW CHOW, HL HUANG, CL Cheng Kung Univ. Tainan Taiwan Cheng Kung University Tainan Taiwan

A distribution system emergency dispatch technique based on outage conditions is proposed that is based on searching from a database containing precalculated solutions. Load flow solutions for possible outage cases under various conditions are simulated and calculated and kept in the database. At the occurrence of fault, a suitable solution is retrieved from this database and use to restore the nonfaulted out-or-service area. The method, which is implemented on an AT&T 3B2/300 supermicrocomputer, finds the appropriate solution in a very efficient way. A real-time computation for load-flow solutions is also suggested to improve the database for better system operation. Tests to support the technique are discussed.< >

关键词： Real time systems Switches Load flow Automation Substations Computational modeling Computerized monitoring Computer simulation Microcomputers data flow computing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Machine-Generated data Modeling Approach Based on Domain-Aware Knowledge for Intelligent Consumer Electronics

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2023年第4期69卷 984-995页

作者： Liu, Zheng Weng, Yu Xu, Ruiyang Chaomurilige Kim, Jung Yoon Minzu Univ China Dept Chinese Ethn Minor Languages & Literatures Beijing 100081 Peoples R China Minzu Univ China Key Lab Ethn Language Intelligent Anal & Secur Gov Minist Educ Beijing 100081 Peoples R China Gachon Univ Coll Future Ind Seongnam 13120 South Korea

data modeling is a critical component in the development of next-generation consumer electronics (CE), as it provides massive data support to implement smart services related to CE products, such as complex correlation analysis of the CE market, the development of technology, and consumer behaviors. However, the existing works still face the following challenges: (1) the manual data processing is time-consuming and labor-intensive while analyzing the massive data with domain knowledge;(2) insufficient attention is given to the analysis of relationships among data collections;and (3) redundant data is not eliminated, leading to excess computational burden. To address these challenges, we propose an efficient automatic data modeling method that employs domain-aware knowledge, significantly reducing the cost of data modeling. Our approach starts by leveraging a knowledge-based classifier to extract domain-related resources from open common single-document summarization datasets (OC-SDS), thus reducing data acquisition expenses. Then after collecting related documents by original summaries, a two-stage filtering process is applied to eliminate redundant and non-related documents. Finally, the original summaries are iteratively updated until reaching the threshold, enhancing informativeness and introducing novel expressions without the need for manual marking. As a practical application, we take emergency news as an example and built a typical dataset based on our method. After an extensive analysis, the empirical results evidence that our method is superior in scale and quality compared to the existing methods, with over 13.7% more related data, providing a valuable contribution to the field of CE product development.

关键词： Task analysis data-driven modeling data flow computing data collection natural language processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：