Maria Cristina Pinotti

Learn More
This paper introduces the Parallel Priority Queue (PPQ) abstract data type. A PPQ stores a set of integer-valued items and provides operations such as insertion of n new items or deletion of the n smallest ones. Algorithms for realizing PPQ operations on an n-processor CREW-PRAM are based on two new data structures, the n-Bandwidth-Heap (n-H) and the(More)
This paper investigates the problem of assigning channels to the stations of a wireless network so that interfering transmitters are assigned channels with a given separation and the number of channels used is minimized. Two versions of the channel assignment problem are considered which are equivalent to two specific coloring problems — called(More)
Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel. Cyclically broadcasting data over the channel is a basic scheduling technique, which is known as flat scheduling. When multiple channels are available, a data allocation technique is needed to assign data to channels.(More)
Given an integer > 1, a vector ð 1; 2; . . . ; ÿ1Þ of nonnegative integers, and an undirected graph G 1⁄4 ðV ;EÞ, an Lð 1; 2; . . . ; ÿ1Þ-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that jfðuÞ ÿ fðvÞj i, if dðu; vÞ 1⁄4 i; 1 i ÿ 1, where dðu; vÞ is the distance (i.e., the minimum number of edges) between the(More)
This paper presents parallel algorithms for priority queue operations on a p-processor EREW-PRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue(More)
Sorting networks of a xed I/O size p have been used, thus far, for sorting a set of p elements. Somewhat surprisingly, the important problem of using such a sorting network for sorting arbitrarily large data sets has not been addressed in the literature. Our main contribution is to propose a simple sorting architecture whose main feature is the pipelined(More)
It is believed that broadcast is an efficient way to transmit data in an asymmetric communication system. Most of the previous work focused on either pull-based or push-based scheduling. However, for systems with a very large number of data items, none of these schemes is efficient individually. We propose a novel hybrid scheduling algorithm which uses both(More)
Both base extension and scaling are fundamental operations in residue computing and several techniques have been proposed in the past for their efficient implementation. Using look-up tables, the best result (log:, 1 1 table look-up cycles, where 12 is the number of residue moduli in the system) has been obtained by using the Chinese Remainder Theorem (CRT)(More)