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

DESIGN AND EVALUATION OF EFFECTIVE LOAD SHARING IN DISTRIBUTED real-time SYSTEMS

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第7期5卷 704-719页

作者： SHIN, KG HOU, CJ Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA Department of Electrical and Computer Engineering University of Wisconsin Madison WI USA Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Arbor MI USA

In a distributed real-time system, uneven task arrivals temporarily overload some nodes and leave others idle or underloaded. Consequently, some tasks may miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. An effective load-sharing (LS) scheme is proposed as a solution to this problem. Upon arrival of a task at a node, the node determines whether the node can complete the task in time under the minimum-laxity first-served policy. If the task cannot be guaranteed, or if guarantees of some other tasks are to be violated as a result of the addition of this task to the existing schedule, the node looks up the list of loss-minimizing decisions and determines the best node among a set of nodes in its physical proximity, called its buddy set, to which the task(s) may be transferred. This list of decisions is periodically updated using Bayesian decision analysis and prior/posterior state distributions. These probability distributions are derived from the information collected via time-stamped state-region change broadcasts within each buddy set. By characterizing the inconsistency between a node's ''observed'' state and the corresponding true state with prior and posterior distributions, the node can first estimate the states of other nodes, and then use them to reduce the probability of transferring a task to an ''incapable'' node. Moreover, the use of prior and posterior distributions and Bayesian analysis has made the proposed scheme robust to the variation of design parameters that usually require fine-tuning for adaptive LS. The performance of the proposed scheme is evaluated via simulation, along with five other schemes: no LS, LS with state probing, LS with random selection, LS with focused addressing, and perfect LS. The proposed scheme is shown to outperform all but perfect 1,S scheme in meeting task deadlines and tolerating the delays in state collection and task transfer. The impact of statistical fluctuations in

关键词： DEADLINES real-time SYSTEMS LOAD SHARING LOCATION AND TRANSFER POLICIES BAYESIAN DECISION THEORY PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

Internet of Digital Twin: Framework, Applications and Enabling Technologies

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Liu, Ruhan Luan, Tom H. Qu, Youyang Xiang, Yong Gao, Longxiang Zhao, Dongmei Deakin University School of Info Technology MelbourneVIC3125 Australia Xi'an Jiaotong University School of Cyber Science and Engineering Shaanxi Xi'an710049 China Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China McMaster University Department of Electrical and Computer Engineering HamiltonON Canada

Intelligent physical systems, such as smart vehicles and robotic arms, are increasingly integrated into both industrial and everyday applications. However, the systems typically face hardware limitations that constrain their computational capacities. Digital twin systems offer a solution by creating real-time digital replicas of physical systems that enhance computational efficiency, overcoming physical limitations. Moreover, multiple digital twins that hold complementary knowledge can conveniently collaborate to share information and computational resources, further improving the performance of physical systems by forming an Internet of Digital Twin (IoDT). This paper presents a comprehensive investigation of the digital twin network, tracing the evolution of digital twins and providing a classification of the key technologies, functional frameworks, and application domains of IoDT. This paper delves into the IoDT communication framework by studying the fundamental communication modes of IoDT, exploring its integration with advanced technologies such as edge computing, blockchain, 5G/6G networks, and machine learning to facilitate data transmission, interaction, and omni-directional sensing. By offering a broad perspective, the paper aims to deepen stakeholders' understanding of current research and potential future developments, encouraging further exploration of IoDT technologies and their evolution. © 1998-2012 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Adaptive Filter for Head Tracking in Augmented reality (AR)-based Flight Simulators

引用

IEEE Transactions on computers 2025年

作者： Nwobodo, Onyeka J. Kuaban, Godlove Suila Nkemeni, Valery Wereszczynski, Kamil Cyran, Krzysztof A. Silesian University of Technology Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Gliwice Poland Polish Academy of Sciences Institute of Theoretical and Applied Informatics Poland University of Buea Laboratory of Electrical Engineering and Computing Faculty of Engineering and Technology Buea Cameroon

This paper presents a novel approach for head tracking in augmented reality (AR) flight simulators using an adaptive fusion of Kalman and particle filters. This fusion dynamically balances the strengths of both algorithms, leveraging Kalman filters for computational efficiency and particle filters for handling non-linearities based on real-time factors such as sensor noise and head movement patterns. Our method demonstrates superior tracking precision and reduced latency, making it particularly effective for immersive pilot training in AR-based flight simulations. While focused on flight simulation, our approach holds high potential for broader applications in other AR and virtual reality (VR) environments where precise, real-time head tracking is crucial. These results provide actionable design guidance for developers optimizing tracking systems in environments that require fast response times and high accuracy. Future extensions of this research could explore the generalization of our approach across diverse AR applications, including human-computer interaction (HCI), medical simulations, and gaming. © 1968-2012 IEEE.

关键词： Flight simulators

来源：评论

学校读者我要写书评

暂无评论

PRIAM: Polite rescheduler for intelligent automated manufacturing

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1996年第2期12卷 235-245页

作者： Tsukada, TK Shin, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper considers the problem of rescheduling in a decentralized manufacturing system, Flexible manufacturing systems must be able to respond to unexpected disruptions, including schedule disruptions, However, when a cell controller in a decentralized system responds to a disruption, it may disrupt some other cell, because the actions taken at one cell may have some consequence at another cell, In the approach we propose, a controller at a disrupted cell tries to respond in a way which is likely to be least disruptive to other cells, through negotiation with controllers at other cells, This approach, which we call ''polite replanning,'' has the advantage of retaining much of any original distributed plan, while avoiding wide propagation of the disruption through the rest of the system, We apply this concept to the domain of distributed factory rescheduling, and describe PRIAM (polite rescheduler for intelligent automated manufacturing), a ''polite'' rescheduling architecture which is currently under development, Simulation results show that the use of negotiation in ''polite'' rescheduling prevents the wide propagation of disruption from an initial local disruption.

关键词： Manufacturing automation Job shop scheduling Manufacturing systems Control systems Production facilities Flexible manufacturing systems Pulp manufacturing Automatic control computer architecture Computational modeling

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING JOB OPERATIONS IN AN AUTOMATIC ASSEMBLY LINE

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1991年第3期7卷 333-341页

作者： SHIN, KG ZHENG, Q Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper addresses the problem of scheduling job operations in an automatic assembly line used for manufacturing a small to medium volume of mixed workparts. The assembly line model used here differs from the classical flow shop model in the following three aspects: 1) there are no buffers at machine stations, 2) constraints associated with the material transport system are included, and 3) for each batch of production, workparts are distinguished in groups, rather than individually. An "optimal" algorithm that requires very little computation is derived first by minimizing the total finish time for two machine assembly lines. This result is then generalized to the problem of scheduling an assembly line with m > 2 machines processing single-operation jobs. In order to reduce the computational complexity of the latter problem, heuristic algorithms are also proposed and shown to work quite well for all the cases considered. Finally, a heuristic solution to the problem of scheduling an assembly line with m > 2 machines processing multioperation jobs is discussed.

关键词： Job shop scheduling Processor scheduling Heuristic algorithms Flexible manufacturing systems Optimal scheduling Assembly systems Manufacturing automation Pulp manufacturing Scheduling algorithm Mass production

来源：评论

学校读者我要写书评

暂无评论

real-time COMMUNICATIONS IN A computer-CONTROLLED WORKCELL

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1991年第1期7卷 105-113页

作者： SHIN, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A computer-integrated manufacturing (CIM) system is composed of several workcells, each of which contains robots, NC machines, sensors, and a transport mechanism. Each CIM workcell is controlled by multiple processors interconnected by an intracell bus, but the individual cells are interconnected by an arbitrary network. This paper considers a communication subsystem that is designed to support real-time control and coordination of devices in each CIM cell. The concept of a poll number is proposed to control the access to the intracell bus. The bus access mechanism with the poll number is intended to minimize the probability of real-time messages missing their deadlines. When a CIM task generates a time-constrained message, a poll number is computed for this message according to the message's deadline and the task's prority. When the intracell bus is free, the various tasks at a workcell that desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then the corresponding task drops out of the contention for the bus. Use of a poll number provides not only for decentralized control of the intracell bus, but also a high degree of flexibility in scheduling messages. The performance of the bus access mechanism with a poll number is analyzed and compared with that of a token bus, which is widely used in CIM systems such as MAP networks. The probability of a real-time message missing its deadline in a token bus is found to be much higher than that of the proposed mechanism.

关键词： computer integrated manufacturing Communication system control Robot sensing systems Robot kinematics Sensor systems Distributed control Job shop scheduling Performance analysis Manufacturing automation Access protocols

来源：评论

学校读者我要写书评

暂无评论

DESIGN FOR TEST USING PARTIAL PARALLEL SCAN

引用

IEEE TRANSACTIONS ON computer-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1990年第2期9卷 203-211页

作者： LEE, SG SHIN, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Traditional scan design techniques such as level-sensitive scan design, scan path, and random-access scan suffer from the drawback that the extra test application effort (which includes both time and memory) required is directly proportional to the number of latches and can become quite significant. A scan design technique termed partial parallel scan which reduces test application effort by one to two orders of magnitude is presented. Theoretical and practical aspects of the design method are discussed. The practical use of the partial parallel scan technique has been demonstrated with an LSI circuit and a VLSI circuit designed using silicon compiler tools.< >

关键词： Circuit testing Latches Design for testability Hardware Circuit faults Design automation Switches Design methodology Large scale integration Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT CLOCK SYNCHRONIZATION IN LARGE MULTIcomputer SYSTEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1994年第9期5卷 912-923页

作者： OLSON, A SHIN, KG Real-Time Computing Laboratory Computer Science and Engineering Division Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The cost of synchronizing a multicomputer increases with system size. For large multicomputers, the time and resources spent to enable each node to estimate the clock value of every other node in the system can be prohibitive. We show how to reduce the cost of synchronization by assigning each node to one or more groups, then having each node estimate the clock values of only those nodes with which it shares a group. Since each node estimates the clock value of only a subset of the nodes, the cost of synchronization can be significantly reduced. We also provide a method for computing the maximum skew between any two nodes in the multicomputer, and a method for computing the maximum time between synchronizations. We also show how the fault tolerance of the synchronization algorithm may be determined.

关键词： CLOCK SYNCHRONIZATION CLOCK SKEW CLOCK DRIFT FAULT TOLERANCE MULTIcomputer SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

A SIMPLE DISTRIBUTED LOOP-FREE ROUTING STRATEGY FOR computer-COMMUNICATION NETWORKS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1993年第12期4卷 1308-1319页

作者： SHIN, KG CHOU, CC Real-Time Computing Laboratory Computer Science and Engineering Division Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The loops resulting from either component failures or Load changes in a computer communication network degrade the performance and the adaptability of conventional distributed adaptive routing strategies, such as ARPANET's previous routing strategy (APRS). In this paper, we develop a distributed loop-free routing strategy by adding only one additional piece of information-the total number of minimum-delay paths-to the commonly used routing messages and tables. Most conventional approaches to the looping problem suffer high overheads in time and space because each message must either include the first several nodes of its path or trace the entire path to detect a loop. By contrast, the proposed routing strategy requires only easily obtainable information, yet removes loops completely. It is far more efficient in both time and space than its conventional counterparts, especiallyTable Ifor sparse computer networks. The correctness of the proposed strategy is proved, and several illustrative e?xamples are given. The performance of this strategy is shown to be always better than, or at least as good as, that of APRS and any multiorder routing strategies, where the order of a routing strategy is determined by the amount of routing information carried in each routing message.

关键词： ARPANET computer COMMUNICATION NETWORKS DISTRIBUTED ADAPTIVE ROUTING LOOP-FREE OR FAULT-TOLERANT ROUTING NETWORK DELAY TABLES STRATEGY ROUTING MESSAGES

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT COORDINATION OF MULTIPLE SYSTEMS WITH NEURAL NETWORKS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1991年第6期21卷 1488-1497页

作者： CUI, XZ SHIN, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Many control applications require cooperation of two or more independently designed, separately located, but mutually affecting, subsystems. In addition to the good behavior of each subsystem, effective coordination of these subsystems is very important to achieve the desired overall system performance. However, such coordination is very difficult to accomplish due mainly to the lack of precise system models and/or dynamic parameters as well as the lack of efficient tools for system analysis, design, and real-time computation of optimal solutions. A new multiple-system coordinator that combines the techniques of intelligent control and neural networks, and forms the high-level coordinator in a hierarchical structure, is proposed. The basic idea is to estimate the effects of the control commands to subsystems using a predictor and modify these commands using a knowledge-based coordinator so as to achieve the desired performance. The predictor is designed for multiple-input, multiple-output systems using neural networks. The knowledge-based coordinator is responsible for a goal-oriented search in its knowledge base and the overall system stability. Because the internal structure and parameters of the low level are not affected by using the proposed method, some commercially designed servo controllers for single systems can be coordinated to perform more sophisticated tasks for multiple systems than originally intended.

关键词： Intelligent networks Neural networks Control systems System performance Intelligent control real time systems Humans Intelligent structures Stability Design methodology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：