Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Routes of Persuasion

Routes of Persuasion

Persuasion is the process of changing our attitude toward something based on some kind of communication. Much of the persuasion we experience comes from outside forces. How do people convince others to change their attitudes, beliefs, and behaviors? What communications do you receive that attempt to persuade you to change your attitudes, beliefs, and behaviors?

Mean free path and Mean free time

Mean free path and Mean free time

Consider the gas molecules in a cylinder. They move in a random motion as they collide with each other and change speed and direction. The average of all the path lengths between collisions is known as the "mean free path."

Path Between Thermodynamics States

Path Between Thermodynamics States

Consider the two thermodynamic processes involving an ideal gas that are represented by paths AC and ABC in Figure 1:

Interference: Path Lengths

Interference: Path Lengths

Consider two sources of sound, that may or may not be in phase, emitting waves at a single frequency, and consider the frequencies to be the same.
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...

Behavior of Gas Molecules: Molecular Diffusion, Mean Free Path, and Effusion

Behavior of Gas Molecules: Molecular Diffusion, Mean Free Path, and Effusion

Although gaseous molecules travel at tremendous speeds (hundreds of meters per second), they collide with other gaseous molecules and travel in many different directions before reaching the desired target. At room temperature, a gaseous molecule will experience billions of collisions per second. The mean free path is the average distance a molecule travels between collisions. The mean free path increases with decreasing pressure; in general, the mean free path for a gaseous molecule will be...

Routes of Drug Administration: Parenteral

Routes of Drug Administration: Parenteral

The administration of drugs via parenteral routes allows for direct drug introduction into the systemic circulation, resulting in high bioavailability because the medication bypasses the harsh conditions of the gastrointestinal tract and hepatic metabolism.
The intravenous route (IV) of drug administration can be further categorized into two types. The bolus injection administers the entire dose rapidly, while an intravenous infusion slowly delivers smaller doses steadily.
The IV route is often...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Glucocorticoid dose at discharge and the risk of infectious complications and rehospitalization in renal diseases.

Clinical and experimental nephrology·2026

Same author

A case of chronic Campylobacter fetus infection-related glomerulonephritis, mimicking systemic autoimmune diseases.

CEN case reports·2026

Same author

Treatment Patterns, Characteristics, and Probable Acute Medication Overprescription Among Patients With Migraine in Japan: A Retrospective Cross-Sectional and Longitudinal Analysis of Health Insurance Claims Data.

Cureus·2025

Same author

Prospective randomized trial of antibiotic prophylaxis for percutaneous renal biopsy.

Clinical and experimental nephrology·2024

Same author

An IT-based self-checking system of spreadsheet exercises for learners with visual impairments.

Disability and rehabilitation. Assistive technology·2023

Same author

A report of three cases of patients with tubulointerstitial nephritis with IgM-positive plasma cells, treatment, and serum-IgM as a sensitive marker for relapse.

BMC nephrology·2023

Search research articles

Related Experiment Video

Updated: Feb 2, 2026

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Published on: April 23, 2016

Torus Pairwise Disjoint-Path Routing.

Antoine Bossard¹, Keiichi Kaneko²

¹Graduate School of Science, Kanagawa University, Kanagawa 259-1293, Japan. abossard@kanagawa-u.ac.jp.

Sensors (Basel, Switzerland)

|November 16, 2018

Summary

This study introduces a new routing algorithm for torus networks in supercomputers, ensuring reliable data transfer and enhancing system security. The algorithm efficiently finds vertex-disjoint paths, crucial for parallel computing and the Internet of Things (IoT).

Keywords:

algorithm fault tolerance interconnect parallel processing system dependability

More Related Videos

Pairwise Growth Competition Assay for Determining the Replication Fitness of Human Immunodeficiency Viruses

Pairwise Growth Competition Assay for Determining the Replication Fitness of Human Immunodeficiency Viruses

Published on: May 4, 2015

Low-stress Route Learning Using the Lashley III Maze in Mice

Low-stress Route Learning Using the Lashley III Maze in Mice

Published on: May 22, 2010

Related Experiment Videos

Last Updated: Feb 2, 2026

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Foraging Path-length Protocol for Drosophila melanogaster Larvae

Published on: April 23, 2016

Pairwise Growth Competition Assay for Determining the Replication Fitness of Human Immunodeficiency Viruses

Pairwise Growth Competition Assay for Determining the Replication Fitness of Human Immunodeficiency Viruses

Published on: May 4, 2015

Low-stress Route Learning Using the Lashley III Maze in Mice

Low-stress Route Learning Using the Lashley III Maze in Mice

Published on: May 22, 2010

Area of Science:

Computer Science
Parallel Computing
Network Topology

Background:

Modern supercomputers utilize massively parallel architectures with hundreds of thousands of processors.
Interconnection networks are critical for connecting these processors, with torus topology being a popular choice in systems like Fujitsu K and IBM Blue Gene.
Efficient routing is essential for system dependability, data transfer efficiency, and security in parallel systems.

Purpose of the Study:

To address the pairwise disjoint-path routing problem in torus networks.
To propose a novel routing algorithm for selecting mutually vertex-disjoint paths between specified vertex pairs.
To establish the correctness and complexity of the proposed algorithm for enhanced supercomputer performance and security.

Main Methods:

Development of a new routing algorithm for the pairwise disjoint-path problem in n-dimensional k-ary torus networks.
Formal mathematical analysis to establish the algorithm's correctness and complexity bounds.
Empirical evaluation to assess the practical performance and behavior of the proposed algorithm.

Main Results:

The proposed algorithm connects 'c' vertex pairs with mutually vertex-disjoint paths in an n-dimensional k-ary torus (n < k, k ≥ 5).
Path lengths are bounded by at most 2k(c-1) + n⌊k/2⌋.
The worst-case time complexity of the algorithm is determined to be O(n*c^4).

Conclusions:

The developed routing algorithm provides an efficient solution to the disjoint-path problem in torus networks.
The findings have implications for improving system dependability, data transfer efficiency, and security in large-scale parallel systems.
The algorithm contributes to green computing and enhances trust for applications like the Internet of Things (IoT).