๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partitioning and parallel algorithms for kidney models

โœ Scribed by T.M. Hagstrom; R.P. Tewarson

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
243 KB
Volume
11
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis

A natural partitioning exists for kidney models. For example, if all the variables and equations associated with boundary values and interstitim are classified as basic, then the equations and variables corresponding to each tube can be solved independently. It will be shm how partitioning techniques of this type, used in conjunction with quasi-Newton methods, make it possible to handle -prehensive and realistic models of the kidney on small canputers and also leads to efficient utilization of parallel canputers. The developnent of parallel algorithms using general decanpositions arising in a variety of physical processes will also be discussed.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Algorithms for Counting and Ran
Parallel Algorithms for Counting and Randomly Generating Integer Partitions
โœ Laura A. Sanchis; Matthew B. Squire ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

This paper presents parallel algorithms for determining the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. We present a series of adapt

Serial and Parallel Algorithms for (k,2)
Serial and Parallel Algorithms for (k,2)-Partite Graphs
โœ J.A. Ellis; M. Matamontero; H. Muller ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 693 KB

We introduce a class of layered graphs which we call \((k, 2)\) partite and which we argue are an interesting class because of several important applications. We show that testing for \((k, 2)\) partiteness can be done efficiently both on sequential and parallel machines, by showing that membership

Parallel algorithms for multinephron ren
Parallel algorithms for multinephron renal medullary models
โœ K. Sun; I.H. Moon; R.P. Tewarson; J.L. Stephenson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 764 KB

A multiple-nephron inner medullary model is extended to include the outer medulla. The number of solutes modeled is also increased to include osmolyte in the central compartment. Two efficient parallel algorithms are described for solving the systems of differential and algebraic equations arising i

An efficient clustering algorithm for pa
An efficient clustering algorithm for partitioning parallel programs
โœ Piyush Maheshwari; Hong Shen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled ลฝ . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm