نتایج جستجو برای: high performance architecture

تعداد نتایج: 3011852  

1993
Borut Robic Jurij Silc

We explore time and space optimization problems involved in the mapping of parallel algorithms onto a honeycomb architecture. When a well-known mapping is used, mapped algorithms generally exhibit execution slowdown and require too large area. We design several optimization techniques and enhance the mapping process. Experimental results show more than 50 % saving in processor resources and 30 ...

2015
Marc Duranton Koen De Bosschere Albert Cohen Jonas Maebe Harm Munk

contents executive summary

2014
Mateo Valero

One of the key deliverables of the EU HiPEAC FP6 Network of Excellence is a roadmap on high-performance embedded architecture and compilation – the HiPEAC Roadmap for short. This paper is the result of the roadmapping process that took place within the HiPEAC community and beyond. It concisely describes the key research challenges ahead of us and it will be used to steer the HiPEAC research eff...

2010
Hiroyuki Kosai Tyler Bixel Seana McNeal Jeffrey Stricker James Scofield Navjot Brar Jennifer DeCerbo Biswajit Ray

Evolutionary increases in the demand on electrical power systems have resulted in the need to develop the next generation of compact, power dense, electrical systems utilizing robust and efficient high voltage power devices that are operable over an extended temperature range (-55°C to 250°C). In particular, there is a need to investigate novel capacitive architectures as a means to compliment ...

2003
Gösta Granlund Per-Erik Forssén Björn Johansson

A learning system architecture using a channel information representation has been developed. This representation implies that signals are monopolar and local. Monopolar means that data only utilizes one polarity, e.g. positive values, allowing zero to represent no information. Locality derives from a partially overlapping mapping of signals into a higherdimensional space. This implies that a s...

Journal: :Computer Vision and Image Understanding 2008
Javier Díaz Eduardo Ros Vidal Rodrigo Agís José Luis Bernier

Optical-flow computation is a well-known technique and there are important fields in which the application of this visual modality commands high interest. Nevertheless, most real-world applications require real-time processing, an issue which has only recently been addressed. Most real-time systems described to date use basic models which limit their applicability to generic tasks, especially w...

2003
Christopher Brown Andreas Savakis

Error diffusion is one of the most widely used algorithms for halftoning gray scale and color images. It works by distributing the thresholding error of each pixel to unprocessed neighboring pixels, while maintaining the average value of the image. Error diffusion results in inter-pixel data dependencies that prohibit a straightforward data pipelining processing approach and increase the memory...

1998
Klaus Schug Anura P. Jayasumana Prasanth Gopalakrishnan

Current communication subsystem mechanisms within workstation and PC class computers are limiting network communications throughput to a small percentage of the present network data rates. Even though CPU and computer network speeds have increased by more than an order of magnitude, the execution rate of computer functions and applications requiring network communications have increased only ma...

Journal: :Concurrency and Computation: Practice and Experience 2010
Mehmet S. Aktas Marlon E. Pierce

We introduce a distributed high performance hybrid Information Service Architecture, which forms a metadata replica hosting system to manage both highlydynamic, small-scale and relatively-large, static metadata associated to Grid/Web Services. We present an empirical evaluation of the proposed architecture and investigate its practical usefulness. The results demonstrate that the proposed syste...

Journal: :Electr. Notes Theor. Comput. Sci. 2005
Jesper Andersson Morgan Ericsson Welf Löwe

This paper introduces an approach to dynamic software composition in the context of scientific computing where hight demands on performance seem to prevent such flexible solutions. In our concrete scenario, however, dynamic software composition is rather a way to guarantee highperformance that an obstacle to it. We achieve this by combining dynamic architectures and task graph scheduling.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید