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

Multiple-goal objective functions for optimization of task assignment in complex computer systems

Annual Review in Automatic Programming 1994年第C期18卷 55-60页

作者： Marlowe, T.J Stoyenko, A.D Laplante, P.A Daita, R.S Amaro, C.C Nguyen, C.M Howell, S.L Department of Mathematics and Computer Science Seton Hall University South Orange NJ 07079 United States Real-Time Computing Laboratory New Jersey Institute of Technology Newark NJ 07102 United States Real-Time Computing Laboratory NJIT Newark NJ 07102 United States Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ 07940 United States Naval Surface Warfare Center Dahlgren Division Silver Spring MD 20903-5640 Code B40 10901 New Hampshire Ave United States

Complex systems are large applications, typically running on distributed, heterogeneous networks, driven by a number of distinct constraints and desiderata on goals such as performance, real-time behavior, and fault tolerance. These requirements frequently conflict, and satisfaction of these design objectives interacts strongly with assignment of system tasks to processors. The NSWC design framework DESTINATION provides an assignment module which can be used to optimize the system, as measured by the value of a weighted combination of objective cost functions. For even modest-sized systems and networks, assignment space is too large to search exhaustively. We have implemented algorithms which generate heuristically good assignments. However, compile-time evaluation of many interesting design factors, even those clearly related to assignment, is impossible without some estimate of the schedule. We therefore provide approaches for determining a reasonable "pseudo-schedule" for a given system, network, and assignment, and use this to simulate execution in evaluating cost functions. © 1994.

关键词： allocation assignment Complex real-time systems heuristics scheduling

来源：评论

学校读者我要写书评

暂无评论

Requirements for a real-time Image Processing Language 1

引用

IFAC Proceedings Volumes 1994年第6期27卷 175-180页

作者： P. Laplante T. Marlowe A. Stoyenko Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ 07940 USA research faculty of the Real- Time Computing Laboratory (CIS NJIT) Department of Mathematics and Computer Science Seton Hall University South Orange NJ 07079 USA Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ 07102 USA

In this paper we discuss issues in real-time image processing, including applications, approaches, and hardware. In particular, we discuss the failure of existing programming languages to support these considerations,... 详细信息

关键词： real-time image processing programming languages virtual reality multimedia

来源：评论

学校读者我要写书评

暂无评论

A projection based real-time system for edge detection

A projection based real-time system for edge detection

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： P. Sinha Real-Time Computing Laboratory Department of Computer Science New Jersey Institute of Technology Newark NJ USA

A projection based approach for real-time detection of boundaries in an image having linear segments is described. The main processes involved in this approach are: image acquisition, edge detection, peak detection, and connectivity analysis. This technique uses parameterized representation of the straight line and is efficiently implemented in a systolic architecture.< >

关键词： real time systems Image edge detection Image segmentation Layout Gray-scale Image analysis computer architecture Mobile robots Object recognition Noise reduction

来源：评论

学校读者我要写书评

暂无评论

DOCTOR: An Integrate Software Fault Injection environrnent - an Extended Abstract

DOCTOR: An Integrate Software Fault Injection environrnent -...

引用

Int'l Workshop on Integrating Error Models with Fault Injection

作者： Seungjae Han H.A. Rosenberg Kang G. Shin Red-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

来源：评论

学校读者我要写书评

暂无评论

Use of concurrency enhancement in off-line schedule construction

Use of concurrency enhancement in off-line schedule construc...

引用

Workshop on Parallel and Distributed real-time Systems

作者： Guohui Yu Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)0818664207

To improve the performance of programs composed of abstract data types (ADTs), a parallel execution model is used to exploit concurrency at the method level. Typically, an ADT instance is used to manage more than one variable, and there may be contention for getting access to the ADT instance if multiple variables need to be accessed concurrently. To resolve the contention, the ADT instance is cloned, and the copies are placed in different processors so that the multiple copies can be used concurrently. To exploit automatically the concurrency available via ADT instance cloning, we analyze program dependence relations. Not only control and data dependence but also instance dependence is analyzed to reveal dependence relations among method calls and to determine the clonability of each ADT instance. The focus of this paper is the use of our ADT cloning techniques to help ease the task of off-line scheduling in hard-real-time systems. Cloning and ARPCs are applied repeatedly to increase concurrency within processes missing deadlines, thus reducing their execution times.< >

关键词： Concurrent computing Optimal scheduling Cloning Processor scheduling real time systems Content management Automatic control Costs Programming Software maintenance

来源：评论

学校读者我要写书评

暂无评论

Least-Space-time-First Scheduling Algorithm: A Policy for Complex real-time Tasks in Multiple Processor Systems

引用

IFAC Proceedings Volumes 1994年第6期27卷 33-38页

作者： Bo-Chao Cheng Alexander D. Stoyenko Thomas J. Marlowe Real-Time Computing Laboratory Department of Computer and Information Science New Jersey Institute of Technology Newark New Jersey 07102 USA Department of Mathematic and Computer Science Seton Hall University South Orange NJ 07079 USA

Significant prior work exists on scheduling for the ’simple-tasks-single-processor’, ’simple-tasks-multiple-processor’, and ’complex-tasks-single-processor’, but few researchers have yet considered the ’complex-tasks-multiple-processor’ model. We propose a new algorithm, Least Space-time First (LSTF), to deal with the general ’complex-task-multiple-processor’ model. We demonstrate that LSTF outperforms the Highest-Level-First, Earliest Deadline-First and Least-Laxity-First scheduling disciplines in the sense of minimizing maximum tardiness of a set of tasks. LSTF can gracefully incorporate some realistic overhead assumptions, including context switch and communication. The Unit Precedence Graph and Soft-Precedence Edges significantly facilitate implementation of LSTF.

关键词： Scheduling Tardiness MIMD Precedence Graph LSTF and Overhead

来源：评论

学校读者我要写书评

暂无评论

Replication and allocation of task modules in distributed real-time systems

Replication and allocation of task modules in distributed re...

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： Chao-Ju Hou K.G. Shin Computer Engineering Division Department of Elect. and Computer Engineering University of Wisconsin Madison WI USA Real-Time Computing Laboratory Department of Elect. Engineering and Comp. Science University of Michigan Ann Arbor MI USA

This paper addresses the problem of replicating and allocating periodic task modules to processing nodes (PNs) in distributed real-time systems subject to task precedence and timing constraints. The probability that all tasks can be completed before their deadlines-termed as the probability of no dynamic failure (P/sub ND/)-is used as the performance-related reliability measure. Modules which are critical in meeting task deadlines are then selected using the critical path analysis. To provide the timing correctness embedded in P/sub ND/, both original and replicated task modules are not only assigned to PNs, but also scheduled on each PN so as to meet the deadlines of all tasks. The module allocation scheme uses (1) the branch-and-bound method to implicitly enumerate all possible allocations while effectively pruning unnecessary search paths; and (2) the module scheduling scheme to schedule the modules assigned to each PN. Several numerical examples are presented to illustrate the proposed scheme.< >

关键词： real time systems Vehicle dynamics Job shop scheduling Timing Distributed computing Performance evaluation Aircraft Aerospace control Vehicles Production facilities

来源：评论

学校读者我要写书评

暂无评论

Meeting the strict real-time requirements of distributed continuous multimedia applications

Meeting the strict real-time requirements of distributed con...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： W.A. Halang P.A. Laplante A.D. Stoyenko Faculty of Electrical Engineering FernUniversität Hagen Hagen Germany Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ USA Real Time Computing Laboratory Department of Computer and Information Sciences New Jersey Institute of Technology Newark NJ USA

In this paper we discuss synchronization techniques-and specifically their implementation at the hardware, operating system and high-level language levels-that can be used to achieve deadline satisfaction. In particular, it is shown that by endowing process control computers with fully parallel input and output mechanisms making use of exact time specifications, synchronization and deadline satisfaction can be achieved at the same time without any jitter. Continuous multimedia applications require accurate synchronization of the clocks in different processors. The available solutions have considerable accuracy or applicability. Local clock synchronization by radio transmitted time information turns out to be the only general purpose and high accuracy technique that is applicable with reasonable effort.< >

关键词： Application software Synchronization Multimedia computing Virtual reality Colored noise Hardware Operating systems TV Clocks Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

FDDI-M: a scheme to double FDDI's ability of supporting synchronous traffic

FDDI-M: a scheme to double FDDI's ability of supporting sync...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： K.G. Shin Qin Zheng Real-Time Computing Laboratory Department of Electrical Engineering and Comput. Science University of Michigan Ann Arbor MI USA Mitsubishi Electric Research Laboratories Cambridge Research Center Cambridge MA USA

Synchronous messages are usually generated periodically and each of them is required to be transmitted before the generation of the next message. Due to the inherent deficiency in its Medium Access Control (MAC) protocol, an FDDI token ring can use at most one half of its ring bandwidth to transmit such synchronous traffic. This deficiency greatly reduces the FDDI's capability of supporting multimedia applications like real-time voice/video transmissions. In this paper, we show how a few simple modifications to the FDDI's MAC protocol can remove this deficiency and double a ring's ability of supporting synchronous traffic. The modified protocol, called FDDI-M, preserves all other good features of an FDDI network and can also achieve a higher throughput for asynchronous traffic than the standard FDDI and the FDDI-II, thus making it useful even for those networks without heavy synchronous traffic.

关键词： FDDI Bandwidth Synchronous generators Telecommunication traffic Token networks Media Access Protocol ANSI standards Laboratories Access protocols Throughput

来源：评论

学校读者我要写书评

暂无评论

Multiple-Goal Objective Functions For Optimization of Task Assignment in Complex computer Systems

引用

IFAC Proceedings Volumes 1994年第6期27卷 55-60页

作者： T.J. Marlowe A.D. Stoyenko P.A. Laplante R.S. Daita C.C. Amaro C.M. Nguyen S.L. Howell Department of Mathematics and Computer Science Seton Hall University South Orange NJ 07079 USA Real- Time Computing Laboratory New Jersey Institute of Technology Newark NJ 07102 USA Real-Time Computing Laboratory NJIT Newark NJ 07102 USA Department of Mathematics and Computer Science Fairleigh Dickinson University Madison NJ 07940 USA Naval Surface Warfare Center Dahlgren Division Code B40 10901 New Hampshire Ave. Silver Spring MD 20903-5640 USA

Complex systems are large applications, typically running on distributed, heterogeneous networks, driven by a number of distinct constraints and desiderata on goals such as performance, real-time behavior, and fault tolerance. These requirements frequently conflict, and satisfaction of these design objectives interacts strongly with assignment of system tasks to processors. The NSWC design framework DESTINATION provides an assignment module which can be used to optimize the system, as measured by the value of a weighted combination of objective cost functions. For even modest-sized systems and networks, assignment space is too large to search exhaustively. We have implemented algorithms which generate heuristically good assignments. However, compile-time evaluation of many interesting design factors, even those clearly related to assignment, is impossible without some estimate of the schedule. We therefore provide approaches for determining a reasonable “pseudo-schedule” for a given system, network, and assignment, and use this to simulate execution in evaluating cost functions.

关键词： Complex real-time systems allocation scheduling heuristics assignment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：