Exploiting the error resilience of emerging data-rich applications, approximate computing promotes the introduction of small amount of inaccuracy into computing systems to achieve significant reduction in computing resources such as power, design area, runtime or energy. Successful applications for approximate computing have been demonstrated in the areas of machine learning, image processing a...

In this article, a laminar magnetohydrodynamics (MHD) developing flow of an incompressible electrically conducting fluid subjected to an external magnetic field is considered. The aim of the study is to propose a correlation for computing the development length of the laminar MHD developing flow in a pipe. A numerical approach is considered to solve the problem. In the first step, the numerical...

In the context of synthesis, scheduling assigns operations to control steps. Operations are the atomic components used for describing behavior, for example, arithmetic and Boolean operations. They are ordered partially by data dependencies (data-flow graph) and by control constructs such as conditional branches and loops (control-flow graph). A control step usually corresponds to one state, one...

ePUMA[1] is an ongoing project in the Division of Computer Engineering at Linköping university, Sweden. It is supported by the SSF, Swedish Foundation for Strategic Research. The goal of this project is to develop a Parallel ASIP DSP processor for realtime stream computing. The essential technology is to separate data access kernels from arithmetic computing kernels so as to hide or minimize da...

Although data pow analysis was first developed for use in compilers, i t s usefulness is now recognized in many software tools. Because of its compiler origins, the computation of data pow for software tools is based on the traditional exhaustive data flow framework. However, although this framework is useful for computing data pow for compilers, it is not the most appropriate for sofsware tool...

Recently, the scheduling problem in distributed data-intensive computing environments has been an active research topic. This Chapter models the scheduling problem for work-flow applications in distributed dataintensive computing environments (FDSP) and makes an attempt to formulate the problem. Several meta-heuristics inspired from particle swarm optimization algorithm are proposed to formulat...