全文获取类型
收费全文 | 174篇 |
免费 | 6篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 1篇 |
综合类 | 4篇 |
金属工艺 | 1篇 |
机械仪表 | 2篇 |
无线电 | 25篇 |
一般工业技术 | 3篇 |
原子能技术 | 2篇 |
自动化技术 | 147篇 |
出版年
2021年 | 2篇 |
2019年 | 1篇 |
2017年 | 2篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 9篇 |
2013年 | 9篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2010年 | 9篇 |
2009年 | 11篇 |
2008年 | 16篇 |
2007年 | 7篇 |
2006年 | 5篇 |
2005年 | 5篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 12篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 9篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1981年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有185条查询结果,搜索用时 15 毫秒
1.
Paolo Detti 《Journal of Scheduling》2008,11(3):205-212
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled
jobs. 相似文献
2.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(1-3):165-184
The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature. 相似文献
3.
Integrating job parallelism in real-time scheduling theory 总被引:1,自引:0,他引:1
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions. 相似文献
4.
In this paper we present several new results in the theory of homogeneous multiprocessor scheduling. We start with some assumptions about the behavior of tasks, with associated precedence constraints, as processor power is applied. We assume that as more processors are applied to a task, the time taken to compute it decreases, yielding some speedup. Because of communication, synchronization, and task scheduling overhead, this speedup increases less than linearly with the number of processors applied. We also assume that the number of processors which can be assigned to a task is a continuous variable, with a view to exploiting continuous mathematics. The optimal scheduling problem is to determine the number of processors assigned to each task, and task sequencing, to minimize the finishing time.These assumptions allow us to recast the optimal scheduling problem in a form which can be addressed by optimal control theory. Various theorems can be proven which characterize the optimal scheduling solution. Most importantly, for the special case where the speedup function of each task isp
, wherep is the amount of processing power applied to the task, we can directly solve our equations for the optimal solution. In this case, for task graphs formed from parallel and series connections, the solution can be derived by inspection. The solution can also be shown to be shortest path from the initial to the final state, as measured by anl
1/
distance metric, subject to obstacle constraints imposed by the precedence constraints.This research has been funded in part by the Advanced Research Project Agency monitored by ONR under Grant No. N00014-89-J-1489, in part by Draper Laboratory, in part by DARPA Contract No. N00014-87-K-0825, and in part by NSF Grant No. MIP-9012773. The first author is now with AT&T Bell Laboratories and the second author is with BBN Incorporated. 相似文献
5.
We present two improved results for scheduling batched parallel jobs on multiprocessors with mean response time as the performance metric. These results are obtained by using a generalized analysis framework where the response time of the jobs is expressed in two contributing factors that directly impact a scheduler’s competitive ratio. Specifically, we show that the scheduler IGDEQ is 3-competitive against the optimal while AGDEQ is 5.24-competitive. These results improve the known competitive ratios of 4 and 10, obtained by Deng et al. and by He et al., respectively. For the common case where no fractional allotments are allowed, we show that slightly larger competitive ratios can be obtained by augmenting the schedulers with the round-robin strategy. 相似文献
6.
We explore novel algorithms for DVS (Dynamic Voltage Scaling) based energy minimization of DAG (Directed Acyclic Graph) based applications on parallel and distributed machines in dynamic environments. Static DVS algorithms for DAG execution use the estimated execution time. The estimated time in practice is overestimated or underestimated. Therefore, many tasks may be completed earlier or later than expected during the actual execution. For overestimation, the extra available slack can be added to future tasks so that energy requirements can be reduced. For underestimation, the increased time may cause the application to miss the deadline. Slack can be reduced for future tasks to reduce the possibility of not missing the deadline. In this paper, we present novel dynamic scheduling algorithms for reallocating the slack for future tasks to reduce energy and/or satisfy deadline constraints. Experimental results show that our algorithms are comparable to static algorithms applied at runtime in terms of energy minimization and deadline satisfaction, but require considerably smaller computational overhead. 相似文献
7.
This paper first develops architecture for a multiprocessor job scheduling system with an embedded simulation technique. The architecture provides a shell for applications that are characterized by two scheduling policies, a heuristic algorithm policy and a First-In-First-Out (FIFO) policy. These policies are implemented in the simulation model by using the embedded technique. The paper evaluates these two policies using the queue length, waiting time and flow time as the criteria to compare the performance of these two scheduling policies. Next we designed two simulation situations using two different real world applications. The purpose is to examine the performances of multiprocessor systems with and without inspection operations and two different scheduling policies. The two applications, berth allocation for the container terminal operations and production scheduling arrangement in an Original Equipment Manufacturer (OEM) power supply factory, are studied. The final results show that a proper scheduling policy will perform better than the traditional FIFO approach for a multiprocessor system. Our study also provides guidelines on balancing a system with the addition of a final inspection activity. 相似文献
8.
The paper offers an associative-neural-net method to optimize resource allocation between independent tasks in a multiprocessor
system. In the case of a dual-core CPU the method allows the task to be fully solved in O(M) operations.
The text was submitted by the authors in English. 相似文献
9.
10.
本文给出了一种多微处理器体系结构,重点讨论了多微处理器间信息交换和仲裁逻辑的实现机制及具体设计步骤,并给出了具体实现的硬件逻辑电路及交换的时序图。实际运行表明:该仲裁逻辑电路具有仲裁开销小、扩缩性好、可靠性高等特点;它完全能满足高性能的测控系统和各种高精度的智能仪器仪表的特殊要求。 相似文献