In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the original hypergraph by successively projecting and refining the bisection to the next level finer hypergraph. We have developed new hypergraph coarsening strategies within the multilevel framework. We evaluate their performance both in terms of the size of the hyperedge cut on the bisection, as well as on the run time for a number of very large scale integration circuits. Our experiments show that our multilevel hypergraph-partitioning algorithm produces high-quality partitioning in a relatively small amount of time. The quality of the partitionings produced by our scheme are on the average 6%-23% better than those produced by other state-of-the-art schemes. Furthermore, our partitioning algorithm is significantly faster, often requiring 4-10 times less time than that required by the other schemes. Our multilevel hypergraph-partitioning algorithm scales very well for large hypergraphs. Hypergraphs with over 100 000 vertices can be bisected in a few minutes on today's workstations. Also, on the large hypergraphs, our scheme outperforms other schemes (in hyperedge cut) quite consistently with larger margins (9%-30%).Index Terms-Circuit partitioning, hypergraph partitioning, multilevel algorithms.

No abstract

BackgroundInfection-related acute kidney injury (AKI) is an important preventable cause of morbidity and mortality in the tropical region. The prevalence and outcome of kidney involvement, especially AKI, in scrub typhus is not known. We investigated all patients with undiagnosed fever and multisystem involvement for scrub typhus and present the pattern of renal involvement seen.MethodsFrom September 2011 to November 2012, blood samples of all the patients with unexplained acute febrile illness and/or varying organ involvement were evaluated for evidence of scrub typhus. A confirmed case of scrub typhus was defined as one with detectable Orientia tsutsugamushi deoxyribonucleic acid (DNA) in patient's blood sample by nested polymerase chain reaction (PCR) targeting the gene encoding 56-kDa antigen and without any alternative etiological diagnosis. Renal involvement was defined by demonstration of abnormal urinalysis and/or reduced glomerular filtration rate. AKI was defined as per Kidney Disease: Improving Global Outcomes (KDIGO) definition.ResultsOut of 201 patients tested during this period, 49 were positive by nested PCR for scrub typhus. Mean age of study population was 34.1±14.4 (range 11–65) years. Majority were males and a seasonal trend was evident with most cases following the rainy season. Overall, renal abnormalities were seen in 82% patients, 53% of patients had AKI (stage 1, 2 and 3 in 10%, 8% and 35%, respectively). The urinalysis was abnormal in 61%, with dipstick positive albuminuria (55%) and microscopic hematuria (16%) being most common. Acute respiratory distress syndrome (ARDS) and shock were seen in 57% and 16% of patients, respectively. Hyperbilirubinemia was associated with AKI (p = 0.013). A total of 8 patients (including three with dialysis dependent AKI) expired whereas rest all made uneventful recovery. Jaundice, oliguria, ARDS and AKI were associated with mortality. However, after multivariate analysis, only oliguric AKI remained a significant predictor of mortality (p = 0.002).ConclusionsScrub typhus was diagnosed in 24% of patients presenting with unexplained febrile illness according to a strict case definition not previously used in this region. Renal abnormalities were seen in almost 82% of all patients with evidence of AKI in 53%. Our finding is contrary to current perception that scrub typhus rarely causes renal dysfunction. We suggest that all patients with unexplained febrile illness be investigated for scrub typhus and AKI looked for in scrub typhus patients.

In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the original hypergraph by successively projecting and refining the bisection to the next level finer hypergraph. We evaluate the performance both in terms of the size of the hyperedge cut on the bisection as well as run time on a number of VLSI circuits. Our experiments show that our multilevel hypergraph partitioning algorithm produces high quality partitioning in relatively small amount of time. The quality of the partitionings produced by our scheme are on the average 4% to 23% better than those produced by other state-of-the-art schemes. Furthermore, our partitioning algorithm is significantly faster, often requiring 4 to 15 times less time than that required by the other schemes. Our multilevel hypergraph partitioning algorithm scales very well for large hypergraphs. Hypergraphs with over 100,000 vertices can be bisected in a few minutes on today's workstations. Also, on the large hypergraphs, our scheme outperforms other schemes (in hyperedge cut) quite consistently with larger margins (9% to 30%).

Physical Design of modern systems on chip is extremely challenging. Such digital integrated circuits often contain tens of millions of logic gates, intellectual property blocks, embedded memories and custom RTL blocks. At current and future technology nodes, their power and performance are impacted, more than ever, by the placement of their modules. However, our experiments show that traditional techniques for placement and floorplanning, and existing academic tools cannot reliably solve the placement task.To study this problem, we identify particularly difficult industrial instances and reproduce the failures of existing tools by modifying public-domain netlists. Furthermore, we propose algorithms that facilitate floorplacement of these difficult instances. Empirically, our techniques consistently produced legal placements, and on instances where comparison is possible, reduced wirelength by 3.5% over Capo 9.4 and 14.5% over PATOMA 1.0 -the pre-existing tools that most frequently produced legal placements in our experiments.