The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study node-to-set and set-to-set fault tolerant routing problems in n-dimensional hypercubes H n . Node-to-set routing problem is that given a node s and a set of nodes T={t 1 ,...,t k }, finds k node-disjoint paths s->t i ,1=<i=<k. Set-to-set routing problem is that given two sets of nodes S={s 1 ,...,s k } and T={t 1 ,...,t ...
Barrier is an important synchronization operation. On scalable parallel computers, it is often implemented as a collective communication. A typical barrier synchronization operation consists of a reduction operation followed by a distribution operation. In this paper, we introduce a systematic way of generating efficient algorithms to perform barrier synchronization in mesh networks. The scheme works...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.