Abstract: A fluid flow is simulated by causing a computer to perform operations on data stored in the memory to compute at least one eddy of a fluid flow at a first scale and perform operations to compute at least one eddy of the fluid flow at both the first scale and a second scale. The second scale is a finer scale than the first scale, and the computation of the at least one eddy of the fluid flow at the second scale is constrained by results of the computation of the at least one eddy of the fluid flow at the first scale.

Abstract: A fluid flow is simulated by causing a computer to perform operations on data stored in the memory to compute at least one eddy of a fluid flow at a first scale and perform operations to compute at least one eddy of the fluid flow at both the first scale and a second scale. The second scale is a finer scale than the first scale, and the computation of the at least one eddy of the fluid flow at the second scale is constrained by results of the computation of the at least one eddy of the fluid flow at the first scale.

Abstract: A fluid flow is simulated by causing a computer to perform operations on data stored in the memory to compute at least one eddy of a fluid flow at a first scale and perform operations to compute at least one eddy of the fluid flow at both the first scale and a second scale. The second scale is a finer scale than the first scale, and the computation of the at least one eddy of the fluid flow at the second scale is constrained by results of the computation of the at least one eddy of the fluid flow at the first scale.

Abstract: A fluid flow is simulated by causing a computer to perform operations on data stored in the memory to compute at least one eddy of a fluid flow at a first scale and perform operations to compute at least one eddy of the fluid flow at both the first scale and a second scale. The second scale is a finer scale than the first scale, and the computation of the at least one eddy of the fluid flow at the second scale is constrained by results of the computation of the at least one eddy of the fluid flow at the first scale.

Abstract: A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.

Abstract: A method of managing segments in a distributed-file system implemented by a plurality of file servers includes determining a segment of the distributed-file system controlled by a first file server for which control is to be migrated, selecting a second file server, that is different from the first file server, to take control of the segment, and moving control of the segment from the first file server to the second file server.

Abstract: Methods and systems are described comprising a plurality of nodes each comprising at least one processor and at least one storage device providing storage for the system along with an interconnect configured to establish connections between pairs of nodes. The nodes may be configured (e.g. programmed) to determine from a file identifier that identifies a particular file that a node desires to access, which of the plurality of nodes stores the desired file. The interconnect may then establish a connection between the node and the node storing the file to permit the node desiring access to access the file (e.g., read or write the file). Further, the system comprising the plurality of nodes (e.g., a cluster computing architecture) may be balanced or nearly balanced.

Abstract: A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.