The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Several algorithms for instantaneous blind source separation (BSS) have been introduced in the past years. The performance of these algorithms needs to be evaluated and assessed to study their merits and choose the best of them for a given application. In this paper, a new adaptive approach is presented to evaluate different blind source separation algorithms. In this new approach, three new evaluation...
The Cell Broadband Engine (CBE) is a heterogeneous multi-core processor with unique design properties for high-performance computing. It consists of one power processing element (PPE) and eight synergistic processing elements (SPEs) connected with the elements interconnect network (EIB). It employs some novel techniques, such as software managed cache, to hide memory latency and guarantees, by default,...
Heterogeneous computing (HC) systems use different types of machines, networks, and interfaces to coordinate the execution of various task components which have different computational requirements. This variation in tasks requirements as well as machine capabilities has created a very strong need for developing mapping techniques to decide on which task should be moved to where and when, to optimize...
Distributed Object Oriented (DOO) applications have been developed for solving complex problems in various scientific fields. One of the most important aspects of the DOO systems is the efficient distribution of software classes among different nodes in order to solve the mismatch problem that may appear when the software structure does not match up the available hardware organization. We have proposed...
There have been a large number of projects based on the Distributed Object Oriented (DOO) approach for solving complex problems in various scientific fields. The Mismatch problem is one of the most important problems facing the DOO system, where the initial design of the DOO application does not give the best class distribution. In such a case, the DOO software may need to be restructured. In this...
The problem of sorting has been studied extensively and many algorithms have been suggested in the literature for the problem. Literature on parallel sorting is abundant. Many of the algorithms proposed, though being theoretically important, may not perform satisfactorily in practice owing to large constants in their time bounds. The algorithms presented in this paper have the potential of being practical...
Over the last few years, designers and engineers utilized the Object-Oriented (OO) approach in developing distributed software systems. One of the most important aspects of the Distributed Object Oriented (DOO) systems is the efficient distribution of software classes among different nodes. The initial design of the DOO application does not necessarily have the best class distribution and may need...
Mapping and scheduling of Meta-tasks in distributed heterogeneous computing systems are complex computational problems. They are known to be NP-Complete except under a few special situations. Solving the mapping problem is basically deciding on which task should be moved to where and when, to improve the overall performance. There is a wide variety of approaches to the problem of mapping and scheduling...
In this paper, we present a new heuristic algorithm to schedule a set of independent stochastic tasks with parallelizable contents in multiprocessor systems. Each task is described by its deadline and its time cost distribution, which is given in terms of mean and variance. A scheduled task may run as one unit on a single processor or partitioned into k parallel parts running on k different processors...
In this paper, the execution time cost of a parallel computation in a shared memory environment is defined as a function of the input, the algorithm, the data structure, the processor speed, the number of processors, the processing power allocation and the communication between processors. The computation structure model is modified to describe the impact of these seven factors on the computation's...
In the paper the time costs of several parallel computation structures are analyzed. These analyses are based on the assumptions that the processes communicate implicitly via the shared memory and that a locking mechanism is imposed on the access to shared variables. In previous work, an approach to estimating a set of special parallel computation structures has been developed. In this paper, we expand...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.