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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

3,815 篇 会议
182 篇 期刊文献
83 册 图书
1 篇 学位论文

馆藏范围

4,081 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,093 篇 工学
- 1,908 篇 计算机科学与技术...
- 1,023 篇 软件工程
- 368 篇 电气工程
- 154 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 75 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
526 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

647 篇 parallel process...
545 篇 parallel program...
527 篇 computer archite...
462 篇 parallel archite...
448 篇 concurrent compu...
358 篇 parallel algorit...
320 篇 programming
313 篇 hardware
283 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
165 篇 parallel process...
164 篇 dynamic programm...
154 篇 application soft...
138 篇 program processo...
138 篇 costs
138 篇 distributed comp...
136 篇 libraries
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 school of comput...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,044 篇 英文
29 篇 其他
11 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4081 条记录，以下是3751-3760 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

New Vlsi architectures For parallel Implementation Of The Viterbi Decoder

New Vlsi Architectures For Parallel Implementation Of The Vi...

引用

IEEE international symposium on Information Theory

作者： F. Daneshgaran K. Yao University of California Los Angeles CA USA

来源：评论

学校读者我要写书评

暂无评论

9th international symposium on Applied Algebra, Algebraic algorithms and Error-Correcting Codes, AAECC 1991

9th International Symposium on Applied Algebra, Algebraic Al...

引用

9th international symposium on Applied Algebra, Algebraic algorithms and Error-Correcting Codes, AAECC 1991

ISBN: (纸本)9783540545224

The proceedings contain 45 papers. The special focus in this conference is on Applied Algebra. The topics include: algorithms for the shape of semialgebraic sets. a new approach;on the parameters of algebraic geometric cedes;on wiedemann's method of solving sparse linear systems;fast algorithms for decoding orthogonal and related codes;jacobian matrices and constructions in algebra;homogenity, pseudo-homogenity, and grobner basis computations;arithmetic on non-supersingular elliptic curves;implementing some algorithms of kantor;computing roadmaps of general semi-algebraic sets;an improved sign determination algorithm;buchberger algorithm and integer programming;new systolic architectures for cyclic code encoding;algebraic constructions of efficient broadcast networks;error-correction for WIMs and WUMs;some constructions in rings of differential polynomials;an algorithm for the computation of the radical of an ideal in the ring of polynomials;polynomial-time construction of spherical codes;algorithms for a multiple algebraic extension ii;on the orphans and covering radius of the reed-muller codes;a joint authentication and encryption scheme based on algebraic coding theory;some results on linear unequal-error-protection codes specified by their generator matrix;an ackermannian polynomial idealsome undecidability results for weakly confluent monadic string-rewriting systems;calculating multidimensional symmetric functions using jacobi's formula;multivariate sturm theory;binary spherical geometric codes;an algebraic construction of generalized beenkefs cedes;improving the time complexity of the computation of irreducible and primitive polynomials in finite fields;completely transitive codes and distance transitive graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementing a conventional language for a dataflow architecture

Implementing a conventional language for a dataflow architec...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： S.F. Wail RMIT Centre for Concurrent Computing Division of Information Technology CSIRO Carlton Australia

Details the implementation of the Pascal programming language for a dataflow architecture. The reasons for choosing this particular architectural model and language was to achieve maximum parallelism with minimal specification by the programmer. Issues that are discussed involve the analysis and transformation of code to maximise parallelism, and the generation of an applicative intermediate code form (IF1) to be later translated into machine code for a wide range of parallel architectures. Specific emphasis is given to those features of Pascal and other conventional languages that are omitted from parallel functional languages for dataflow architectures, such as global variables, function side-effects, variable aliasing, and pointers. Loop and general code optimizations are also introduced in order to maximise parallelism. Some simulation results are presented which highlight the extent of parallelism available in a conventional language.< >

关键词： parallel processing programming profession Computer architecture parallel architectures parallel programming Functional programming Program processors Concurrent computing Information technology Australia

来源：评论

学校读者我要写书评

暂无评论

A simulation of demand-driven dataflow: translation from Lucid into MDC language

A simulation of demand-driven dataflow: translation from Luc...

引用

international symposium on parallel Processing

作者： G.K. Thiruvathukal T.W. Christopher Department of Computer Science Illinois Institute of Technology USA

Message Driven Computation (MDC) is a model of computation with which they have been experimenting at the Illinois Institute of Technology. The authors aim to prove the viability of MDC in practice for the expression of parallel algorithms and the implementation of functional and dataflow programming languages. In the paper they discuss their implementation of the Lucid programming language in MDC. The discussion presents a subset of Lucid which illustrates the principles of Lucid, Message Driven Computing, and the translation into and the interpretation of dataflow graphs.< >

关键词： Concurrent computing Distributed computing Computational modeling Computer languages Filters History Computer science parallel algorithms parallel programming Message passing

来源：评论

学校读者我要写书评

暂无评论

2nd Annual international symposium on algorithms, ISA 1991

2nd Annual International Symposium on Algorithms, ISA 1991

引用

2nd Annual international symposium on algorithms, ISA 1991

ISBN: (纸本)9783540549451

The proceedings contain 41 papers. The special focus in this conference is on algorithms. The topics include: Decision-making with incomplete information;maximum independent set of a permutation graph in k tracks;algorithms for square roots of graphs;distributed k-mutual exclusion problem and k-coteries;weighted random assignments with application to hashing;scheduling file transfers under port and channel constraints;substitution decomposition on chordal graphs and applications;mixed-searching and proper-path-width;short wire routing in convex grids;a new approach to knock-knee channel routing;an average case analysis of monien and speckenmeyer's mechanical theorem proving algorithm;an on-line algorithm for navigating in unknown terrain;on maintaining the width and diameter of a planar point-set online;optimal triangulations by retriangulating;an incremental algorithm for constructing shortest watchman routes;on hitting grid points in a convex polygon with straight lines;on the complexity of some hamiltonian and eulerian problems in edge-colored complete graphs;dynamic programming on intervals;combinatorial optimization through order statistics;combinatorics and algorithms of geometric arrangements;an analysis of randomized shear sort on the mesh computer;efficient parallel divide-and-conquer for a class of lnterconnection topologies;optimal specified root embedding of full binary trees in faulty hypercubes;a tight lower bound for the worst case of bottom-up heapsort;historical searching and sorting;comparison-efficient and write-optimal searching and sorting;nearest neighbors revisited;competitiveness and response time in on-line algorithms;a linear time optimal via assignment algorithm for three-dimensional channel routing;symmetry of information and one-way functions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Triangulation in a plane and 3D convex hull on mesh-connected arrays and hypercubes

Triangulation in a plane and 3D convex hull on mesh-connecte...

引用

international symposium on parallel Processing

作者： J.A. Holey O.H. Ibarra Department of Computer Science University of Minnesota Minneapolis MN USA Department of Computer Science University of California Santa Barbara CA USA

The authors present four new parallel algorithms for triangulation of points in a plane. The first two, for one-way iterative arrays and two-way cellular arrays, requiring O(n) time and O(n) processors. Next they give an algorithm for d-dimensional mesh arrays which requires O(n/sup 1/d/) time and a hypercube algorithm with a worst case running time of O(log/sup 3/ n) and an expected running time of O(log/sup 2/ n), both using O(n) processors. The linear array algorithms are the first known of for these architectures which compute Delaunay and greedy triangulations. The mesh array and hypercube algorithms appear to be the first which directly compute a triangulation on these architectures. These algorithms can be modified to compute the Voronoi diagram of points in the plane and the convex hull of points in 3-space.< >

关键词： Hypercubes parallel algorithms Iterative algorithms Computer science Computer architecture Application software Concurrent computing Multidimensional systems Computational geometry Robot vision systems

来源：评论

学校读者我要写书评

暂无评论

Mapping algorithms onto parallel architectures: time schedules

Mapping algorithms onto parallel architectures: time schedul...

引用

1991 Second international Specialist Seminar on the Design and Application of parallel Digital Processors

作者： W. Shang J.A.B. Fortes Purdue University USA University of Southwestern Louisiana USA

Time scheduling is one of the important problems faced in mapping algorithms onto parallel architectures, particularly in real-time fault-tolerant computing. The paper shows how linear schedules can be used to exploit parallelism available in nested-loop programs. It relates linear schedules to known loop transformation techniques for modeling the parallel execution and extracting parallelism of nested loop structures. These techniques are the Doaccross technique used to model the simultaneous execution of loop computations that belong to different iterations and a technique for parallelism exploitation called selective cycle shrinking. It is shown how selective shrinking is related to linear scheduling of nested loops and how to find the selective shrinking with minimum total execution time by applying techniques of finding optimal linear schedules. The execution of these schedules can be modeled using the Doaccross technique.< >

关键词： Computer fault tolerance parallel algorithms parallel architectures parallel programming Real time systems Scheduling

来源：评论

学校读者我要写书评

暂无评论

An algorithm for dynamic reconfiguration of a multicomputer network

An algorithm for dynamic reconfiguration of a multicomputer ...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： J.M. Garcia J. Duato Departamento de Informática Universidad de Castilla La Mancha Albacete Spain Facultad de Informática Universidad Politécnica de Valencia Valencia Spain

The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers to reduce the communication overhead. The authors present an algorithm for the dynamic reconfiguration of the network. Reconfiguration is limited, preserving the original topology. Long distance message passing is minimized by positioning communication partners close to each other. The algorithm is transparent to the application programmer and is not restricted to a particular class of applications, being very well suited for parallel applications whose communication pattern varies over time. The paper also presents some simulation results, showing the benefits from the new reconfiguration algorithm.< >

关键词： Heuristic algorithms Routing Application software Multiprocessor interconnection networks parallel architectures Hypercubes Delay Network topology Message passing programming profession

来源：评论

学校读者我要写书评

暂无评论

Uniform design of parallel programs for DSP

Uniform design of parallel programs for DSP

引用

IEEE international symposium on Circuits and Systems (ISCAS)

作者： J. Teich L. Thiele Institute of Microelectronics University of Saarland Saarbruecken Germany

It is shown that there is a close relationship between the mappings of sequentially formulated algorithms onto different kinds of parallel architectures. The compilation of programs for these architectures shares common optimization features, such as a high degree of parallelism, a short execution time, and a high processor utilization, and also a common design trajectory. Given a problem formulation, parallelism is extracted. Equivalence transformations are applied for the purpose of optimization. In the mapping phase, resources are assigned to operations and a schedule is defined. In order to match a problem and an architecture of given size, hierarchical transformations are performed that partition a problem into problems of smaller size that are executed sequentially. Due to these similarities, design methods known for the design and optimization of processor arrays can be used to solve problems known from the design of vectorizing compilers for supercomputers and vice versa. For defining the tasks of a versatile compiler for massive parallel architectures (COMPAR) a set of parameterized tools is defined that allows the uniformization of the mapping of sequential code onto parameterized parallel architectures.< >

关键词： Digital signal processing parallel architectures Computer architecture Signal processing algorithms Algorithm design and analysis parallel processing Iterative algorithms Concurrent computing Design optimization Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Compiling functional languages for SIMD architectures

Compiling functional languages for SIMD architectures

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： G.K. Jouret Department of Computing Imperial College of Science Technology and Medicine London UK

A major impediment to the wider proliferation of Single-Instruction, Multiple Datastream (SIMD) (3) architectures rests in the unsuitability of sequential, scalar, languages for programming data-parallel systems. Existing languages lack sufficient expressive power to describe data-parallel computation. A functional language, extended with data-parallel primitives, provides a powerful abstraction of the capabilities of SIMD architectures. Such a language conveys the following benefits: greater expressive power, a rich set of data-types, transparent access to data-parallelism, amenability to program transformation and consistency with the functional style. A compilation strategy onto an abstract SIMD architecture is presented.< >

关键词： Computer architecture Aggregates Central Processing Unit Runtime parallel processing Calculus Educational institutions Impedance Vehicles Technological innovation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共409页 << < 372 373 374 375 376 377 378 379 380 381 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：