نتایج جستجو برای: deadlock free
تعداد نتایج: 516672 فیلتر نتایج به سال:
Efficient control schemes are required for effective cooperation of robot teams in a mobile wireless sensor network. If the robots (resources) are also in charge of executing multiple simultaneous missions, then risks of deadlocks due to the presence of shared resources among different missions increase and have to be tackled. Discrete event control with deadlock avoidance has been used in the ...
Deadlock-free dynamic network reconfiguration process is usually studied from the routing algorithm restrictions and resource reservation perspective. The nature yielded by transition one function to another often managed restricting usage in a static predefined manner, which limits supported algorithms and/or inactive link patterns, or either requires additional resources such as virtual chann...
Deadlock-free migration for virtual machine consolidation using Chicken Swarm Optimization algorithm
Network Reconfiguration Processes Olav Lysne, Timothy Mark Pinkston and José Duato Abstract Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches either requir...
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a re...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید