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

3rd Conference on Hypercube Concurrent computers and Applications, C3P 1988

作者： Chen, Ming-Syan Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0897912780

A connected hypercube containing faulty components (nodes or links) is called an injured hypercube. To enable non-faulty nodes to communicate with each other in an injured hypercube, the information of component failures must be made available to those non-faulty nodes for them to route messages around the faulty components. We develop a fault-tolerant routing scheme which requires each node to know only the information on the failure of its own links. Performance of this scheme is rigorously analyzed. This scheme is not only shown to be capable of routing messages successfully in injured hypercubes when the number of component failures is less than n, but also proved to be able to choose a shortest path with a very high probability.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Load sharing in hypercube multicomputer in the presence of node failures 5

Load sharing in hypercube multicomputer in the presence of n...

引用

5th Distributed Memory computing Conference, DMCC 1990

作者： Chang, Yi-Chieh Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818621133

This paper discusses and analyzes two load sharing (LS) issues: adjusting preferred lists and implementing a fault-tolerant mechanism in the presence of node failures. In an early paper, we have proposed to order the nodes in each node's proximity into a preferred list for the purpose of load sharing in distributed real-time systems. The preferred list of each node is constructed in such a way that each node will be selected as the kth preferred node by one and only one other node. Such lists are proven to allow the tasks to be evenly distributed in a system. However, the presence of faulty nodes will destroy the original structure of a preferred list if the faulty nodes are simply skipped in the preferred list. An algorithm is therefore proposed to modify each preferred list to retain its original features regardless of the number of faulty nodes in the system. The communication overhead introduced by this algorithm is shown to be minimal. Based on the modified preferred lists, a simple fault-tolerant mechanism is implemented. Each node is equipped with a backup queue which stores and updates the arriving/completing tasks at its most preferred node. Whenever a node becomes faulty, its most preferred node will treat the tasks in the ba,ckup queue as externally arriving tasks. Our simulation results show that this approach, despite of the simplicity, can reduce the number of task losses dramatically, as compared to the approaches without any faulttolerant mechanism. © 1990 IEEE.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Determination of an optimal retry time in multiple-module computing systems 2

Determination of an optimal retry time in multiple-module co...

引用

2nd International Symposium on Uncertainty Modeling and Analysis, ISUMA 1993

作者： Hou, C.-J.J. Shin, K.G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818638508

The optimal amount of time used for retrying an instruction on detection of an error in a computing system is usually determined under the assumption that the system is composed of a single module, within which all fault activities are confined until some module-replacement action is taken. The authors consider fault activities in multiple-module systems. They first relax the single-module assumption and model the fault activities in a multiple-module system as a Markov process. The randomization approach is applied to decompose the Markov process into a discrete-time Markov chain subordinated to a Poisson process. Using this decomposition, several interesting measures can be derived such as the conditional probability of successful retry given a retry period and the fact that a non-permanent fault has occurred, and the mean time until which all modules in the system enter a fault-free state. All the measures derived are used to determine, along with the parameters characterizing fault activities and costs of recovery techniques, whether or not retry should be used as a first-step recovery means on detection of an error;and the best retry period subject to a specific probability of successful retry. © 1993 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

EMERALDS: A microkernel for embedded real-time systems

EMERALDS: A microkernel for embedded real-time systems

引用

1996 IEEE real-time Technology and Applications Symposium, RTAS 1996

作者： Zuberi, Khawar M. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

EMERALDS (Extensible Microkernel for Embedded real time Distributed Systems) is a real time microkernel designed for cost conscious small to medium size embedded systems. It not only offers standard OS services like multi threaded processes, real time scheduling, protected address spaces, message passing, semaphores, and timers, but does so in an efficient manner while keeping the kernel size to just tens of kilobytes. For efficiency, EMERALDS uses the novel approach of mapping the kernel into each user level address space, so even with full memory protection, system calls do not need context switches unless a user level server is involved. EMERALDS also provides the flexibility for users to add communication protocol stacks and device drivers as user level servers without modifying the kernel. We have completed a uniprocessor version of EMERALDS for the Motorola 68040 processor whose size is under 13 KBytes. Context switch takes under 12 /spl mu/s and system calls have overhead just 1.8 /spl mu/s more than that of simple subroutine calls. © 1996 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Support for multiple classes of traffic in multicomputer routers 1st

引用

1st International Workshop on Parallel computer Routing and Communication, PCRCW 1994

作者： Rexford, Jennifer Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)9783540584292

Emerging parallel real-time and multimedia applications broaden the range of performance requirements imposed on the interconnection network. This communication typically consists of a mixture of different traffic classes, where guaranteed packets require bounds on latency or throughput while good average performance suffices for the best-effort traffic. This paper investigates how multicomputer routers can capitalize on low-latency routing and switching techniques for best-effort traffic while still supporting guaranteed communication. Through simulation experiments, we show that certain architectural features are best-suited to particular performance requirements. Based on these results, the paper proposes and evaluates a router architecture that tailors low-level routing, switching, and flow-control policies to the unique needs of best-effort and guaranteed traffic. Careful selection of these policies, coupled with fine-grain arbitration between the classes, allows the guaranteed and best-effort packets to share network bandwidth without sacrificing the performance of either class. © 1994, Springer Verlag. All Rights Reserved.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Adaptive Deadlock-Free Routing in Multicomputers Using only One Extra Virtual Channel

Adaptive Deadlock-Free Routing in Multicomputers Using only ...

引用

1993 International Conference on Parallel Processing, ICPP 1993

作者： Su, Chien-Chun Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0849389836

We present three protocols defin ing the relationship between messages and the chan nel resources requested: request-then-hold, requestthen wait, and request-then-relinquish. Based on the three protocols, we develop an adaptive deadlockfree routing algorithm called the SP routing. The SP routing uses shortest paths and is fully-adaptive, so messages can be routed via any of the shortest paths from the source to the destination. Since it is a minimal or shortest routing, the SP routing guar antees the freedom of livelocks. The SP routing is not limited to a specific network topology. The main requirement for an applicable network topology is that there exists a deterministic, minimal, deadlock-free routing algorithm. Most ex isting network topologies are equipped with such an algorithm. In this paper, we present an adaptive deadlock-free routing agorithm for n-dimensional meshes by using the SP routing. The hardware re quired by the SP routing uses only one extra virtual channel as compared to the deterministic routing. © 1993 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Towards Energy-Efficiency: Integrating MATD3 Reinforcement Learning Method for Computational Offloading in RIS-Aided UAV-MEC Environments

引用

IEEE Internet of Things Journal 2025年

作者： Wu, Liangshun Zhang, Cong Zhang, Bin Du, Jianbo Qu, Junsuo Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai201210 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Xi'an Key Laboratory of Advanced Control and Intelligent Process School of Automation Xi'an University of Posts & Telecommunications Xi'an710061 China Xinjiang University of Political Science and Law Tumushuke832003 China School of Remote Sensing and Information Engineering Wuhan University Wuhan430079 China Department of Computer City University of Hong Kong 999077 Hong Kong School of Communications and Information Engineering Xi'an University of Posts & Telecommunications Xi'an710061 China

With the proliferation of IoT devices, there is an escalating demand for enhanced computing and communication capabilities. Mobile Edge computing (MEC) addresses this need by relocating computing resources to the network edge, thereby delivering swifter and more efficient services. This paper introduces a computation offloading and energy consumption optimization framework that leverages Reconfigurable Intelligent Surfaces (RIS), Unmanned Aerial Vehicles (UAVs), and MEC. The scheme aims to maximize energy efficiency through the optimization of task allocation, RIS phase shifts, and UAV trajectories. By employing the Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (MATD3) reinforcement learning algorithm, the paper further refines UAV trajectories and RIS configurations. The simulation results indicate that the proposed method surpasses the traditional Concave-Convex Procedure (CCCP) algorithm in both UAV trajectory control and RIS configuration, demonstrating quicker convergence and enhanced stability. The method proves to be adaptable to diverse environments and tasks, showcasing notable benefits in RIS-assisted interference suppression, particularly with large RIS, thereby enhancing UAV data reception rates. Additionally, MATD3 exhibits faster and smoother convergence for extended task durations and smaller RIS scenarios. Simulation results reveal that UAVs tend to move closer to RIS, with energy efficiency falling as IoT tasks increase, affirming the proposed algorithm's high energy efficiency and effectiveness. © 2025 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Non-preemptive scheduling of messages on controller area network for real-time control applications

Non-preemptive scheduling of messages on controller area net...

引用

1995 real-time Technology and Applications Symposium, RTAS 1995

作者： Zuberi, Khawar M. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest deadline (ED) can give greater schedulability, but they are not practical for CAN because if the ID is to reflect message deadlines then a long ID must be used. This increases the length of each message to the point that ED is no better than DM. Our solution to this problem is the mixed traffic scheduler (MTS), which is a cross between ED and DM, and provides high schedulability without needing long IDs. Through simulations, we compare the performance of MTS with that of DM and ED* (an imaginary scheduler which works like ED, except it needs only short IDs). We use a realistic workload in our simulations based on messages typically found in computer integrated manufacturing. Our simulations show that MTS performs much better than DM and at the same level as ED, except under high loads and tight deadlines, when ED* is superior. © 1995 IEEE.

关键词： real time control

来源：评论

学校读者我要写书评

暂无评论

On accurate measurement of link quality in multi-hop wireless mesh networks

On accurate measurement of link quality in multi-hop wireles...

引用

12th Annual International Conference on Mobile computing and Networking, MOBICOM 2006

作者： Kim, Kyu-Han Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2121 United States

ISBN: (纸本)1595932860

This paper presents a highly efficient and accurate link-quality measurement framework, called EAR (Efficient and Accurate link-quality monitoR), for multi-hop wireless mesh networks, that has several salient features. First, it exploits three complementary measurement schemes: passive, cooperative, and active monitoring. EAR maximizes the measurement accuracy by (i) dynamically and adaptively adopting one of these schemes and (ii) opportunistically exploiting the unicast application traffic present in the network, while minimizing the measurement overhead. Second, EAR effectively identifies the existence of wireless link asymmetry by measuring the quality of each link in both directions of the link, thus improving the utilization of network capacity by up to 114%. Finally, its reliance on both the network layer and the IEEE 802.11-based device driver solutions makes EAR easily deployable in existing multi-hop wireless mesh networks without system recompilation or MAC firmware modification. EAR has been evaluated extensively via both n.s-2-based simulation and experimentation on our Linux-based implementation. Both simulation and experimentation results have shown EAR to provide highly accurate link-quality measurements with minimum overhead. Copyright 2006 ACM.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Comparison of connection admission-control schemes in the presence of hand-offs in cellular networks 98

Comparison of connection admission-control schemes in the pr...

引用

4th Annual ACM/IEEE International Conference on Mobile computing and Networking, MobiCom 1998

作者： Choi, Sunghyun Shin, Kang G. Real-Time Computing Laboratory Department Of Electrical Engineering And Computer Science The University Of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)9781581130355

In this paper, we compare four distributed connection admission control schemes in cellular networks where the first two schemes are to keep the hand-off dropping probability below a target value, the third scheme is to guarantee no hand-off drops through a per-connection bandwidth reservation, and the fourth scheme uses another type of per-connection bandwidth reservation. The first scheme predicts the bandwidth required to handle hand-offs by estimating possible hand-offs from adjacent cells, then performs the admission control for each newly-requested connection. On the other hand, the second scheme predicts the total required bandwidth in the current cell by estimating both incoming and outgoing hand-offs at each cell. The third scheme requires the set of cells which the mobile with a newly-requested connection will traverse, and reserves bandwidth for each connection in each of those cells. The fourth scheme reserves bandwidth for each connection in the predicted next cell of a mobile. We adopt the history-based mobility estimation for the first two schemes. Using extensive simulations, the four schemes are compared quantitatively in terms of (1) important performance measures such as the hand-off dropping probability, connection-blocking probability, and bandwidth utilization, (2) dependency on the de-sign parameters, (3) dependency on the mobility estimation accuracy, and (4) complexity. The simulation results indicate that the first scheme is the most desirable in the sense that it achieves reasonably good performance while requiring much less memory and computation than the other three schemes. © Copyright ACM 1998.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：