7156330
Balancing FPGA Resource Utilities
Balancing the use of FGPA resources such as FPGA slices, block RAMs, and block multipliers is desirable in many FPGA applications. This task can be carried out manually by experienced hardware designers with the use of hardware description languages, such as Verilog and VHDL. However, many users of reconfigurable computers are software developers who depend on hardware synthesis tools or even high-level synthesis tools to deal with the details beneath the application logic. In this paper, a motivating example of balancing FPGA resource utilities is given first. A module selection optimization problem is then formulated, in which, balancing FPGA resource utilities is treated as a constraint, so that the solution to the module selection problem is the balanced use of the FPGA resources. Several variations of the problem formulation are discussed. A naive algorithm and an efficient greedy algorithm to solve the problem are provided and compared. Some experimental results are also presented.
52872904
Simulative analysis of dynamic scheduling heuristics for reconfigurable computing of parallel applications
The demand for processing power has been ever increasing with the growth of high-performance computing (HPC) applications and so have the constraints restricting the solutions to such requirements. High-performance distributed and parallel computing and custom-built, hardware-based computing have attempted to address this problem with some success but at a substantial cost. Recently, systems augmented with Field-Programmable Gate Arrays (FPGAs) offering a fusion of traditional parallel and distributed machines with customizable and dynamically reconfigurable hardware have emerged as a cost-effective alternative to traditional systems. However, providing a robust runtime environment for such systems to which HPC users have become accustomed has been fraught with numerous challenges. Dynamic scheduling of large-scale HPC applications in such parallel reconfigurable computing (RC) environments is one such challenge and has not been sufficiently studied to our knowledge. In this paper, we simulatively analyze the performance of several common HPC scheduling heuristics that can be used by an automated job management service to schedule application tasks on a parallel RC system. We also present a performance prediction model which the scheduling heuristics employ to schedule several common HPC applications on a collection of typical FPGA processing platforms.
7182268
Accelerating scientific applications with the SRC-6 reconfigurable computer: methodologies and analysis
Reconfigurable computing offers the promise of performing computations in hardware to increase performance and efficiency while retaining much of the flexibility of a software solution. Recently, the capacities of reconfigurable computing devices, like field programmable gate arrays, have risen to levels that make it possible to execute 64b floating-point operations. SRC Computers has designed the SRC-6 MAPstation to blend the benefits of commodity processors with the benefits of reconfigurable computing. In this paper, we describe our effort to accelerate the performance of several scientific applications on the SRC-6. We describe our methodology, analysis, and results. Our early evaluation demonstrates that the SRC-6 provides a unique software stack that is applicable to many scientific solutions and our experiments reveal the performance benefits of the system.
10633849
Assessing differential usage of usenet social accounting meta-data
We describe a usage study of NetscanTech, a system that generates and publishes daily a range of social metrics across three dimensions: newsgroup, author, and thread, for a set of approximately 15,000 technical newsgroups in Usenet. We bring together three interlinked datasets: survey data, usage log data and social accounting data from Usenet participation, to triangulate the relationship between various user roles and differential usage of social metrics in NetscanTech. We found our most frequent users focused on information related to individual authors far more than any other information provided. In contrast, users that visited less frequently focused more on information related to newsgroups and viewing newsgroup metrics. Our results suggest features that designers and developers of online communities may wish to include in their interfaces to support the cultivation of different community roles.
52819119
Video skimming and characterization through the combination of image and language understanding
Digital video is rapidly becoming important for education, entertainment and a host of multimedia applications. With the size of the video collections growing to thousands of hours, technology is needed to effectively browse segments in a short time without losing the content of the video. We propose a method to extract the significant audio and video information and create a skim video which represents a very short synopsis of the original. The goal of this work is to show the utility of integrating language and image understanding techniques for video skimming by extraction of significant information, such as specific objects, audio keywords and relevant video structure. The resulting skim video is much shorter; where compaction is as high as 20:1, and yet retains the essential content of the original segment. We have conducted a user-study to test the content summarization and effectiveness of the skim as a browsing tool.
5238518
Evolving video skims into useful multimedia abstractions
This paper reports two studies that measured the effects of different “video skim” techniques on comprehension, navigation, and user satisfaction. Video skims are compact, content-rich abstractions of longer videos, condensations that preserve frame rate while greatly reducing viewing time. Their characteristics depend on the image- and audio-processing techniques used to create them. Results from the initial study helped refine video skims, which were then reassessed in the second experiment. Significant benefits were found for skims built from audio sequences meeting certain criteria.
26831752
Incrementally visualising criminal networks
Understanding the information gathered thus far in a criminal investigation is of great importance, particularly in terms of guiding its future course. Since the late 1980's the use of software tools to provide visualisations of this information has become increasingly common. The objective of such tools is to provide, in a readily comprehensible way, the social network of all the people involved. This may include the victims, suspects, witnesses, acquaintances and locations of interest in the investigation such as workplaces or nightclubs. Such diagrammatic representations often provide the focus for discussion among the investigating team and are incrementally added to as new facts are discovered. In this paper we present a brief overview of this important subject area and discuss how such software products could be further enhanced. We also present an example that illustrates the basic principles using a demonstrator we developed.
6308382
Cooperative Rec-I-DCM3: A Population-Based Approach for Reconstructing Phylogenies
In this paper, we study the use of cooperation as a technique for designing faster algorithms for reconstructing phylogenetic trees. Our focus is on the use of cooperation to reconstruct trees based on maximum parsimony. Our baseline algorithm is Rec-I-DCM3, the best-performing MP algorithm known-to-date. Our results demonstrate that cooperation does improve the performance of the baseline algorithm by at least an order of magnitude in terms of running time. The use of cooperation also established a new best known score on one of our datasets.