全文获取类型
收费全文 | 175篇 |
免费 | 38篇 |
国内免费 | 22篇 |
专业分类
电工技术 | 5篇 |
综合类 | 19篇 |
化学工业 | 7篇 |
机械仪表 | 3篇 |
建筑科学 | 4篇 |
矿业工程 | 2篇 |
石油天然气 | 7篇 |
武器工业 | 1篇 |
无线电 | 56篇 |
一般工业技术 | 3篇 |
原子能技术 | 4篇 |
自动化技术 | 124篇 |
出版年
2022年 | 4篇 |
2021年 | 1篇 |
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 3篇 |
2016年 | 3篇 |
2015年 | 5篇 |
2014年 | 12篇 |
2013年 | 13篇 |
2012年 | 9篇 |
2011年 | 12篇 |
2010年 | 4篇 |
2009年 | 18篇 |
2008年 | 21篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 17篇 |
2004年 | 13篇 |
2003年 | 12篇 |
2002年 | 13篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有235条查询结果,搜索用时 15 毫秒
1.
This paper proposes a software pipelining framework, CALiBeR (ClusterAware Load Balancing Retiming Algorithm), suitable for compilers targetingclustered embedded VLIW processors. CALiBeR can be used by embedded systemdesigners to explore different code optimization alternatives, that is, high-qualitycustomized retiming solutions for desired throughput and program memory sizerequirements, while minimizing register pressure. An extensive set of experimentalresults is presented, demonstrating that our algorithm compares favorablywith one of the best state-of-the-art algorithms, achieving up to 50% improvementin performance and up to 47% improvement in register requirements. In orderto empirically assess the effectiveness of clustering for high ILP applications,additional experiments are presented contrasting the performance achievedby software pipelined kernels executing on clustered and on centralized machines. 相似文献
2.
Parthasarathy P. Tirumalai Meng Lee Michael S. Schlansker 《The Journal of supercomputing》1991,5(2-3):119-136
Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90. 相似文献
3.
In this paper,a TPP(Task-based Parallelization and Pipelining)scheme is proposed to implement AVS(Audio Video coding Standard)video decoding algorithm on REMUS(REconfigurable MUltimedia System),which is a coarse-grained reconfigurable multimedia system.An AVS decoder has been implemented with the consideration of HW/SW optimized partitioning.Several parallel techniques,such as MB(Macro-Block)-based parallel and block-based parallel techniques,and several pipeline techniques,such as MB level pipeline and block level pipeline techniques are adopted by hardware implementation,for performance improvement of the AVS decoder.Also,most computation-intensive tasks in AVS video standards,such as MC(Motion Compensation),IP(Intra Prediction),IDCT(Inverse Discrete Cosine Transform),REC(REConstruct)and DF(Deblocking Filter),are performed in the two RPUs(Reconfigurable Processing Units),which are the major computing engines of REMUS.Owing to the proposed scheme,the decoder introduced here can support AVS JP(Jizhun Profile)1920×1088@39fps streams when exploiting a 200 MHz working frequency. 相似文献
4.
描述了开源高性能编译器Open64及向量化框架,给出了多循环层进行依赖关系分析算法和收益分析方法。结合面向DSP架构的SLP向量化框架,给出了一种应用软件流水的向量化算法。实验结果表明软件流水向量化算法适用于某些计算密集的DSP应用,最高加速比达到14.2。 相似文献
5.
6.
7.
8.
一种支持多重循环软件流水的寄存器结构 总被引:1,自引:0,他引:1
寄存器结构及其分配是软件流水算法的关键之一.为支持多重循环的软件流水,该文提出一种新颖的寄存器结构:半共享跳跃式流水寄存器堆.它可以有效地解决多重循环软件流水下的特殊问题,即:同层次和跨层次的寄存器重命名问题以及断流问题;有效地消除外层循环的体间读写相关,提高程序的指令级并行度.它有3种分配方式可供灵活使用:单个寄存器、流水寄存器和寄存器组方式.流水寄存器方式对生存期确定的、局限于一个循环层次的寄存器重命名问题提供简单而有效的支持.寄存器组分配方式解决了多重循环软件流水时变量生存期不确定的情况.跳跃操作为 相似文献
9.
The idea of decomposed software pipelining is to decouple the software pipelining problem into a cyclic scheduling problem without resource constraints and an acyclic scheduling problem with resource constraints. In terms of loop transformation and code motion, the technique can be formulated as a combination of loop shifting and loop compaction. Loop shifting amounts to moving statements between iterations thereby changing some loop independent dependences into loop carried dependences and vice versa. Then, loop compaction schedules the body of the loop considering only loop independent dependences, but taking into account the details of the target architecture. In this paper, we show how loop shifting can be optimized so as to minimize both the length of the critical path and the number of dependences for loop compaction. The first problem is well-known and can be solved by an algorithm due to Leiserson and Saxe. We show that the second optimization (and the combination with the first one) is also polynomially solvable with a fast graph algorithm, variant of minimum-cost flow algorithms. Finally, we analyze the improvements obtained on loop compaction by experiments on random graphs. 相似文献
10.