Virtual cluster scheduling through the scheduling graph

This paper presents an instruction scheduling and cluster assignment approach for clustered processors. The proposed technique makes use of a novel representation named the scheduling graph which describes all possible schedules. A powerful deduction process is applied to this graph, reducing at each step the set of possible schedules. In contrast to traditional list scheduling techniques, the proposed scheme tries to establish relations among instructions rather than assigning each instruction to a particular cycle. The main advantage is that wrong or poor schedules can be anticipated and discarded earlier. In addition, cluster assignment of instructions is performed using another novel concept called virtual clusters, which define sets of instructions that must execute in the same cluster. These clusters are managed during the deduction process to identify incompatibilities among instructions. The mapping of virtual to physical clusters is postponed until the scheduling of the instructions has finalized. The advantages this novel approach features include: (1) accurate scheduling information when assigning, and, (2) accurate information of the cluster assignment constraints imposed by scheduling decisions. We have implemented and evaluated the proposed scheme with superblocks extracted from Speclnt95 and MediaBench. The results show that this approach produces better schedules than the previous state-of-the-art. Speed-ups are up to 15%, with average speed-ups ranging from 2.5% (2-Clusters) to 9.5% (4-Clusters).Peer ReviewedPostprint (published version

A unified modulo scheduling and register allocation technique for clustered processors

This work presents a modulo scheduling framework for clustered ILP processors that integrates the cluster assignment, instruction scheduling and register allocation steps in a single phase. This unified approach is more effective than traditional approaches based on sequentially performing some (or all) of the three steps, since it allows optimizing the global code generation problem instead of searching for optimal solutions to each individual step. Besides, it avoids the iterative nature of traditional approaches, which require repeated applications of the three steps until a valid solution is found. The proposed framework includes a mechanism to insert spill code on-the-fly and heuristics to evaluate the quality of partial schedules considering simultaneously inter-cluster communications, memory pressure and register pressure. Transformations that allow trading pressure on a type of resource for another resource are also included. We show that the proposed technique outperforms previously proposed techniques. For instance, the average speed-up for the SPECfp95 is 36% for a 4-cluster configuration.Peer ReviewedPostprint (published version

Humans shape the year-round distribution and habitat use of an opportunistic scavenger

Research focused on evaluating how human food subsidies influence the foraging ecology of scavenger species is scarce but essential for elucidating their role in shaping behavioral patterns, population dynamics, and potential impacts on ecosystems. We evaluate the potential role of humans in shaping the year-round distribution and habitat use of individuals from a typical scavenger species, the yellow-legged gull (Larus michahellis), breeding at southwestern Spain. To do this, we combined long-term, nearly continuous GPS-tracking data with spatially explicit information on habitat types and distribution of human facilities, as proxied by satellite imagery of artificial night lights. Overall, individuals were mainly associated with freshwater habitats (mean proportion, 95% CI: 40.6%, 36.9%-44.4%) followed by the marine-related systems (40.3, 37.7%-42.8%), human-related habitats (13.5%, 13.2%-13.8%), and terrestrial systems (5.5%, 4.6%-6.5%). However, these relative contributions to the overall habitat usage largely changed throughout the annual cycle as a likely response to ecological/physiological constraints imposed by varying energy budgets and environmental constraints resulting from fluctuations in the availability of food resources. Moreover, the tight overlap between the year-round spatial distribution of gulls and that of human facilities suggested that the different resources individuals relied on were likely of anthropogenic origin. We therefore provide evidence supporting the high dependence of this species on human-related food resources throughout the annual cycle. Owing to the ability of individuals to disperse and reach transboundary areas of Spain, Portugal, or Morocco, international joint efforts aimed at restricting the availability of human food resources would be required to manage this overabundant species and the associated consequences for biodiversity conservation (e.g., competitive exclusion of co-occurring species) and human interests (e.g., airports or disease transmission)

Exploiting pseudo-schedules to guide data dependence graph partitioning

This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters is done by means of graph partitioning algorithms that are guided by a pseudo-scheduler. This pseudo-scheduler is a simplified version of the full instruction scheduler and estimates key constraints that would be encountered in the final schedule. The final scheduling process is bi-directional and includes on-the-fly spill code generation. The proposed scheme is evaluated against previous scheduling approaches using the SPECfp95 benchmark suite. Our modeling results show that better schedules are obtained for most programs across a range of different architectures. For a 4-cluster VLIW architecture with 32 registers and a 2-cycle inter-cluster communication delay we obtain an average speedup of 38.5%.Peer ReviewedPostprint (published version

AGAMOS: A graph-based approach to modulo scheduling for clustered microarchitectures

This paper presents AGAMOS, a technique to modulo schedule loops on clustered microarchitectures. The proposed scheme uses a multilevel graph partitioning strategy to distribute the workload among clusters and reduces the number of intercluster communications at the same time. Partitioning is guided by approximate schedules (i.e., pseudoschedules), which take into account all of the constraints that influence the final schedule. To further reduce the number of intercluster communications, heuristics for instruction replication are included. The proposed scheme is evaluated using the SPECfp95 programs. The described scheme outperforms a state-of-the-art scheduler for all programs and different cluster configurations. For some configurations, the speedup obtained when using this new scheme is greater than 40 percent, and for selected programs, performance can be more than doubled.Peer ReviewedPostprint (published version

Pienjännitekatkaisijoiden säätö

Opinnäytetyön tarkoituksena oli selvittää pienjännitekatkaisijoiden releiden asettelua, jotta asentajilla ja suunnittelijoilla olisi katkaisijan käyttöönottotilanteessa mahdollista tarkistaa sekä tehdä suojareleen asettelu itse. Tavoitteena oli tehdä kattava kokonaisuus katkaisijan ominaisuuksista ja käytöstä, jolloin sekä katkaisijan asettelu että toiminta selviäisi niin suunnittelijoille kuin asennuksia tekeville henkilöillekin. Tämän opinnäytteen tuloksena syntyi aineisto, josta selviää katkaisijan yleisimmät suojausasettelut, niiden arvojen laskentakaavat sekä selvitys tulosten käyttöä varten. Työn tarkoituksena on toimia kirjallisena selvityksenä pienjännitepuolen katkaisijoiden käytöstä Puolustushallinnon Rakennuslaitoksen suunnittelijoille ja asentajille.Starting point was to make instructions about safe mechanism’s that moulded case circuit breakers (MCCB) has and how to tune those. The main aim was to make it for engineers and assemblers so it would be easier for them to work with MCCB´s. The goal was a wide instruction booklet about MCCB´s, properties, where and why to use. Of course all related to problems that employers on field of electricity will have. In a result, based on study about MCCB´s was made a text and instructions booklet how to set, and use circuit breakers

Graphical Framework for Categorizing Data Capabilities and Properties of Objects in the Internet of Things

Things are the core of the Internet of Things (IoT) and must be properly characterized according to the different functions they accomplish. Identifying their capabilities and combining them as sets provides a view on the single or joint properties of existing things and guide in properly designing and building new things while maximizing their potential benefits within an IoT system or application. Building on five essential but independent capabilities of things (Identification, Localization, Sensing, Actuation, and Processing), four categories or groups of things are defined. These groups comprise a particular view of the diversity of objects found in the IoT, as trackable, data, interactive, or smart objects. In this paper, a description of the aforementioned capabilities is presented, stating how each of the groups of objects includes them. Then, given that data are the most important assets for both organizations and individuals a further description of the data objects group is made, proposing a graphical categorization framework that thoroughly describes and measures the level in which each of these capabilities is contained and how it contributes to the performance and data properties of any data object

Data on genotypic distribution and linkage disequilibrium of several ANRIL polymorphisms in hemodialysis patients

A long non-coding RNA called ANRIL located on chromosome 9p21.3 has been identified as a novel genetic factor associated with cardiovascular disease. Investigation of several single nucleotide polymorphisms (SNPs) of Noncoding Antisense RNA in the INK4 Locus (ANRIL) gene are of particular interest. This article reports data related to the research article entitled: "Association of ANRIL gene polymorphisms with major adverse cardiovascular events in hemodialysis patients" (Arbiol-Roca et al. [1]). Data presented show the genotypic distribution of four selected ANRIL SNPs: rs10757278, rs4977574, rs10757274 and rs6475606 in a cohort constituted by 284 hemodialysis patients. This article analyzes the Hardy-Weinberg disequilibrium of each studied SNP, and the linkage disequilibrium between them