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

A programming methodology for designing block recursive algorithms

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2006年第1期22卷 95-121页

作者： Fan, MH Huang, CH Chung, YC Liu, JS Lee, JZ Feng Chia Univ Dept Informat Engn & Comp Sci Taichung 407 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien 974 Taiwan

In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem in its matrix form. Next, we formulate a matrix equation for the matrix of the computational problem. Then, we try to find a solution of the matrix equation such that the solution is composed of simple matrices. Finally, we recursively factorize the subproblem to obtain a tensor product formula representing an algorithm for the given problem. In this methodology, the operations of a tensor product formula can be mapped to language constructs of high-level programming languages. That is, we can generate computer programs, including programs for parallel computers and distributed-memory multiprocessors, from tensor product formulas. In this paper, we use the parallel prefix problem and the discrete Fourier transform problem as examples to illustrate the methodology and derive various parallel prefix and fast Fourier transform algorithms.

关键词： programming methodology tensor product block recursive algorithm parallel processing distributed processing parallel prefix fast Fourier transform

来源：评论

学校读者我要写书评

暂无评论

Research on the Construction of Knowledge Graph Oriented to programming methodology Course 24

Research on the Construction of Knowledge Graph Oriented to ...

引用

16th International Conference on Education Technology and Computers

作者： Ye, Feng Jin, Zishuo Zhai, Mengfan Nedjah, Nadia Zhang, Xuejie Yang, Zihao Hohai Univ Coll Comp & Software Engn Nanjing Jiangsu Peoples R China Univ Estado Rio De Janeiro Dept Elect Engn & Telecommun Engn Fac Rio De Janeiro RJ Brazil

ISBN: (纸本)9798400717819

The course on programming methodology is integral to computer science and software engineering education. Knowledge graph has been an interesting topic in recent decades, and knowledge graph has propelled its use in systematically organizing, thoroughly analyzing, and fully leveraging knowledge to become a focal point in teaching research and application, yielding significant progress. Therefore, this paper proposes a method for constructing a knowledge graph tailored to the curriculum. Furthermore, it establishes a comprehensive course knowledge graph, a student capability knowledge graph, and a course resource knowledge graph. Upon this foundation, by leveraging the multi-model database ArangoDB and the visualization framework GraphVIS, a visualized system for a curriculum knowledge graph has been realized. This study aims to offer a reference for the construction and pedagogical approaches of the course, and preliminary applications of the system have received positive feedback.

关键词： Knowledge graph programming methodology Visualization Pedagogical approach

来源：评论

学校读者我要写书评

暂无评论

A programming methodology for designing block recursive algorithms on various computer networks

A programming methodology for designing block recursive algo...

引用

31st International Conference on Parallel Processing (ICPP 2002)

作者： Fan, MH Huang, CH Chung, YC Feng Chia Univ Dept Informat Engn Taichung 40724 Taiwan

ISBN: (纸本)0769516807

In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previous works, we propose a programming methodology for designing block recursive algorithms on shared-memory and distributed-memory multiprocessors without considering the interconnection of processors. We extend the work to consider the block recursive algorithms on direct networks and multistage interconnection networks. We use parallel prefix computation as an example to illustrate the methodology. First, we represent the prefix computation problem as a computational matrix which may not be suitable for deriving algorithms on specific computer networks. In this methodology, we add two steps to derive tensor product formulas of parallel prefix algorithms on computer networks: (1)decompose the computational matrix into two submatrices, and (2) construct an augmented matrix. The augmented matrix can be factorized so that each term is a tensor product formula and can fit into a specified network topology. With the augmented matrix, the input data is also extended. It means, in addition to the input data, an auxiliary vector as temporary storage is used. The content of temporary storage is relevant to the decomposition of the original computational matrix. We present the methodology to derive various parallel prefix algorithms on hypercube, omega, and baseline networks and veri,, correctness of the resulting tensor product formulas using induction.

关键词： programming methodology tensor product block recursive algorithm parallel processing parallel prefix hypercube network omega network baseline network

来源：评论

学校读者我要写书评

暂无评论

A FORTRAN programming methodology BASED ON DATA ABSTRACTION

引用

COMMUNICATIONS OF THE ACM 1982年第10期25卷 686-697页

作者： ISNER, JF National Geodetic Survey Rockville MD

Data abstraction has been an important consideration since the mid-1970s, with most research effort directed toward the development of experimental languages, formal specification techniques, and program verification schemes. The role of data abstraction in programming methodology, on the other hand, has received considerably less attention. In particular, the potential benefits of the application of data abstraction principles to conventional programming environments have been all but ignored. A programming methodology based on data abstraction and designed especially for the Fortran programming environment is presented here. [ABSTRACT FROM AUTHOR]

关键词： Parnas modules data abstraction information hiding programming methodology state-machine specification technique

来源：评论

学校读者我要写书评

暂无评论

A Flexible programming and Verification methodology for Reconfigurable CNC Woodworking Machine

引用

BIORESOURCES 2024年第4期19卷 970页

作者： Zivanovic, Sasa Dimic, Zoran Furtula, Mladen Slavkovic, Nikola Djurkovic, Marija Vidakovic, Jelena Univ Belgrade Fac Mech Engn Kraljice Marije 16 Belgrade 11120 Serbia LOLA Inst Kneza Viseslava 70a Belgrade 11030 Serbia Univ Belgrade Fac Forestry Kneza Viseslava 1 Belgrade 11030 Serbia

An advanced flexible programming methodology for CNC woodworking machines was developed. As the research starting base, a three-axis CNC woodworking machine was used. The developed methodology is proposed for programming, simulation, postprocessing, and machining by woodworking machine. This flexible programming method integrates the standard programming based on CAD, CAD/CAM systems, and STEP-NC protocol through different output files, enabling data interoperability during the realization of the machining tasks. The control system for the machine is configured based on the open-architecture software LinuxCNC to verify the flexible programming method and the results obtained. programming verification was realized by simulation on a configured virtual machine in different programming environments and finally on a virtual machine integrated with the control system. The results obtained from the study were evaluated comparatively.

关键词： programming methodology CAD/CAM STEP-NC Reconfigurable Woodworking machining Virtual machine

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE programming

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1991年第9期17卷 911-921页

作者： GOUDA, MG HERMAN, T Department of Computer Sciences University of Texas at Austin Austin TX 78712

An adaptive program is one that changes its behavior based on the current state of its environment. This notion of adaptivity is formalized and a logic for reasoning about adaptive programs is presented. The logic includes several composition operators that can be used to define an adaptive program in terms of given constituent programs;programs resulting from these compositions retain the adaptive properties of their constituent programs.

关键词： DISTRIBUTED COMPUTING ADAPTIVE SYSTEMS programming methodology PROGRAM COMPOSITION SELF-STABILIZATION

来源：评论

学校读者我要写书评

暂无评论

A TECHNIQUE FOR ACHIEVING PORTABILITY AMONG MULTIPROCESSORS - IMPLEMENTATION ON THE LEMUR

引用

PARALLEL COMPUTING 1985年第2期2卷 137-162页

作者： CLAUSING, JA HAGSTROM, R LUSK, EL OVERBEEK, RA Argonne National Laboratory Argonne IL 60439 USA

We describe here a programming methodology for multiprocessors that leads to well-structured code, ease of debugging, and, most important, portability among multiprocessors offering quire different synchronization primitives. The emphasis in this paper is on the implementation of this methodology for the Lemur, an eight-processor machine built at Argonne National Laboratory. Included are several complete programs illustrating the methodology.

关键词： implementation of monitors with macros Lemur multiprocessors programming methodology

来源：评论

学校读者我要写书评

暂无评论

Table design in dynamic programming

引用

INFORMATION AND COMPUTATION 2006年第9期204卷 1325-1345页

作者： Steffen, Peter Giegerich, Robert Univ Bielefeld Fac Technol D-33501 Bielefeld Germany

Dynamic programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic programming algorithm is to decide on the set of tables that will hold optimal solutions to subproblems. This step predetermines the shape of the dynamic programming recurrences as well as the asymptotic efficiency of the algorithm in time and space. We study dynamic programming in a formal framework where design of tables and problem decomposition can be done independently. Our main result shows that choosing a good table design for a given decomposition is an NP-complete problem. A heuristic or approximate approach is therefore needed to automate good table design. We report on a strategy that combines user annotation and a brute force algorithm, which is shown to perform well in a large application. (C) 2006 Elsevier Inc. All rights reserved.

关键词： dynamic programming programming methodology NP completeness space-time trade-off

来源：评论

学校读者我要写书评

暂无评论

Direct approaches to exploit many-core architecture in bioinformatics

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2013年第1期29卷 15-26页

作者： Esteban, Francisco J. Diaz, David Hernandez, Pilar Caballero, Juan A. Dorado, Gabriel Galvez, Sergio Univ Malaga ETSI Informat Dep Lenguajes & Ciencias Computac E-29071 Malaga Spain Univ Cordoba Serv Informat E-14071 Cordoba Spain CSIC IAS Cordoba 14080 Spain Univ Cordoba Dep Estadist E-14071 Cordoba Spain Univ Cordoba Dep Bioquim & Biol Mol E-14071 Cordoba Spain

Current trends in computer programming look for solutions in the challenging task of porting and optimizing existing algorithms to many-core architectures with tens of Central Processing Units (CPUs). Yet, the lack of standardized general-purpose parallel programming and porting methodologies represents the main bottleneck on these developments. We have focused on bioinformatics applied to genomics in general and the so-called "Next-Generation" Sequencing (NGS) in particular, in order to study the viability and cost of porting and optimizing well known algorithms to a many-core architecture. Three different methods are tackled in order to implement existing algorithms in Tile64, corresponding to a microprocessor containing 64 CPUs, each of them being capable of executing an independent Linux operating system. Three different approaches have been explored: (i) implementation of the Needleman-Wunsch/Smith-Waterman pairwise aligner from scratch;(ii) direct translation of the Message Passing Interface (MPI) C++ ABySS assembly algorithm with changes on the communication layer;and (iii) migration of the ClustalW tool, parallelizing only the most time-consuming stage. The performance-gain/development-cost tradeoffs indicate that the Tile64 microprocessor has the potential to increase the performance of bioinformatics in an unprecedented way for a standalone Personal Computer (PC). Yet, the effective exploitation of these parallel implementations requires a detailed understanding of the peculiar many-core characteristics when migrating previous non-parallel source codes. (C) 2012 Elsevier B.V. All rights reserved.

关键词： System-on-chip Multiprocessor system Code migration Domain-specific architecture programming methodology Sequence alignment and assembly

来源：评论

学校读者我要写书评

暂无评论

A methodology FOR DEVELOPING DISTRIBUTED PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第8期13卷 967-976页

作者： RAMESH, S MEHNDIRATTA, SL Department of Computer Science and Engineering Indian Institute of Technology

A methodology for constructing distributed programs is presented that is different from existing methodologies. It is based on the well-known notion of developing distributed programs via synchronous and centralized programs. The distinguishing features of the methodology are: 1. Specification includes process structure data, and distributed programs are developed taking this information into account. 2. A new class of programs, called programs with processes involving shared actions, is employed in the development process. 3. A transformational approach is suggested to solve the problems inherent in the method of developing distributed programs through synchronous and centralized programs. The proposed methodology has been applied to many standard problems and found to be very useful.

关键词： Program Transformation Communicating Processes Decentralization Distributed programming programming methodology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：