Pages that link to "Item:Q3950485"

The following pages link to A Fault-Tolerant Communication Architecture for Distributed Systems (Q3950485):

Displaying 15 items.

• A new 3D representation of trivalent Cayley networks (Q287008) (← links)
• Upper bounds on the connection probability for 2-D meshes and tori (Q433405) (← links)
• Shortest routing in trivalent Cayley graph network (Q672093) (← links)
• Trivalent Cayley graphs for interconnection networks (Q672973) (← links)
• Graph theoretic characterization and reliability of the multiple-clique network (Q919011) (← links)
• Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
• Large fault-tolerant interconnection networks (Q1120553) (← links)
• Distributed loop network with minimum transmission delay (Q1193634) (← links)
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (Q1201873) (← links)
• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links (Q1206196) (← links)
• DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS (Q2755580) (← links)
• SOFTWARE TOOLS FOR MULTIPROCESSOR SIMULATION AND PROGRAMMING (Q3352477) (← links)
• (Q4488861) (← links)
• Fault tolerance of Möbius cubes under two forbidden fault set models (Q4828658) (← links)
• A new approach for routing in arrangement graphs and its performance evaluation (Q5096356) (← links)