No abstract

This paper concerns the problem of efficiency of task allocation algorithms used in dynamic mesh structured systems. Expanding Square Strategy (ESS) algorithm was mainly evaluated. The goal was to determine in what kind of situations the ESS algorithm performs in the most efficient way and to compare the ESS to the Window Stack Based Algorithm. The investigations were made using the created simulator and the experimentation system designed and implemented by the authors. The analysis of simulation experiments results justifies some recommendations for using the allocation algorithms in practice.

Chronic kidney disease (CKD) is a broad term used to describe progressive structural and functional kidney disorders that may be accompanied by a decrease in the glomerular filtration rate (GFR), and that have lasted for at least 3 months [1]. The diagnosis of CKD is also made if GFR values are below 60 mL/min/1.73 m 2 for a minimum of 3 months, independently of the presence of kidney damage markers [2,3]. There are several symptoms that can indicate CKD in patients, e.g. abnormalities visible in diagnostic imaging procedures, in blood and urine tests (e.g. proteinuria, abnormal urine sediment) or blood morphology. GFR is, however, the most important factor when it comes to the physiopathology of chronic kidney disease. Nowadays, CKD is classified into five stages, according to the value of this index: stage 1 (GFR > 90 mL/ /min/1.73 m 2 ), stage 2 (60-89 mL/min/1.73 m 2 ), stage 3 (30-59 mL/min/1.73 m 2 ), stage 4 (15-29 mL/min/1.73 m 2 ) and stage 5 (GFR < 15 mL/ /min/1.73 m 2 ). Stage 3 can be further divided into 3A (45-59 mL/min/1.73 m 2 ) and 3B (30-44 mL/ /min/1.73 m 2 ). Stage 5, the most advanced and dangerous one, is also described as "end-stage renal failure" (ESRF), and constitutes an indica-REVIEWS