Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2016
Workflow Scheduling Algorithms for Hard-deadline Constrained Cloud Environments
Procedia Computer Science (PROCS), Volume 80, Issue CPages 2098–2106https://doi.org/10.1016/j.procs.2016.05.529Cloud computational platforms today are very promising for execution of scientific applications since they provide ready to go infrastructure for almost any task. However, complex tasks, which contain a large number of interconnected applications, which ...
- research-articleFebruary 2012
Towards self-optimizing collaborative systems
CSCW '12: Proceedings of the ACM 2012 conference on Computer Supported Cooperative WorkPages 1421–1430https://doi.org/10.1145/2145204.2145414Two important performance metrics in collaborative systems are local and remote response times. Previous analytical and simulation work has shown that these response times depend on three important factors: processing architecture, communication ...
- abstractJune 2011
Brief announcement: reclaiming the energy of a schedule, models and algorithms
SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architecturesPages 135–136https://doi.org/10.1145/1989493.1989512We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the ...
- research-articleMay 2011
Decomposing Workload Bursts for Efficient Storage Resource Management
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 22, Issue 5Pages 860–873https://doi.org/10.1109/TPDS.2010.129The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage systems. The bursty nature of storage workloads raises significant performance ...
- research-articleJune 2010
Update Scheduling for Improving Consistency in Distributed Virtual Environments
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 21, Issue 6Pages 765–777https://doi.org/10.1109/TPDS.2009.113The fundamental goal of distributed virtual environments (DVEs) is to create a common and consistent presentation of the virtual world among a set of computers interconnected by a network. This paper investigates update scheduling algorithms to make ...
-
- research-articleFebruary 2010
The rate region of a cooperative scheduling system
IEEE Transactions on Wireless Communications (TWC), Volume 9, Issue 2Pages 605–613https://doi.org/10.1109/TWC.2010.02.080251A wireless communication system where a common base station is scheduled to transmit information to multiple mobile users on a time division (TD) basis is considered. The capacity region of this system is found for the two user case and the optimal ...
- research-articleJanuary 2010
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
IEEE Transactions on Mobile Computing (ITMV), Volume 9, Issue 1Pages 127–139https://doi.org/10.1109/TMC.2009.113A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the proximity of a sensor node. This can be an alternative to multihop forwarding ...
- research-articleDecember 2009
Improving Spectral and Temporal Efficiency of Collocated IEEE 802.15.4 LR-WPANs
IEEE Transactions on Mobile Computing (ITMV), Volume 8, Issue 12Pages 1596–1609https://doi.org/10.1109/TMC.2009.85The number of frequency channels specified for IEEE 802.15.4 low-rate wireless personal area networks (LR-WPANs) does not suffice to operate a variety of collocated WPAN applications that the standard is targeting. To overcome this limit, we introduce ...
- research-articleNovember 2009
PBC: A Partially Buffered Crossbar Packet Switch
IEEE Transactions on Computers (ITCO), Volume 58, Issue 11Pages 1568–1581https://doi.org/10.1109/TC.2009.65The crossbar fabric is widely used as the interconnect of high-performance packet switches due to its low cost and scalability. There are two main variants of the crossbar fabric: unbuffered and internally buffered. On one hand, unbuffered crossbar ...
- posterJune 2009
Case study of finite resource optimization in FPGA using genetic algorithm
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationPages 989–992https://doi.org/10.1145/1543834.1543990Modern Field-Programmable Gate Arrays (FPGAs) are becoming very popular in embedded systems and high-performance applications. FPGA has benefited from the shrinking of transistor feature size, which allows more on-chip reconfigurable (e.g. memories and ...
- research-articleMay 2009
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
FOWANC '09: Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computingPages 47–56https://doi.org/10.1145/1540343.1540352Data aggregation is an efficient primitive in wireless sensor network (WSN) applications. This paper focuses on data aggregation scheduling problem to minimize the latency. We propose an efficient distributed method that produces a collision-free ...
- research-articleApril 2009
Energy-efficient scheduling of delay constrained traffic over fading channels
IEEE Transactions on Wireless Communications (TWC), Volume 8, Issue 4Pages 1866–1875https://doi.org/10.1109/T-WC.2008.080037A delay-constrained scheduling problem for point-to-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a time-varying channel. The transmitter/scheduler must determine how many bits to transmit, ...
- research-articleFebruary 2008
Energy-Efficient Multihop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IEEE Transactions on Computers (ITCO), Volume 57, Issue 2Pages 231–245https://doi.org/10.1109/TC.2007.70774In this paper we study two-layered heterogeneous sensor networks where two types of nodes are deployed: basic sensor nodes and cluster head nodes. The basic sensor nodes are simple and have limited power supplies, while the cluster head nodes are much ...
- research-articleJune 2007
Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 18, Issue 6Pages 749–762https://doi.org/10.1109/TPDS.2007.1045Over the past decade, the problem of fair bandwidth allocation among contending traffic flows on a link has been extensively researched. However, as these flows traverse a computer network, they share different kinds of resources (e.g., links, buffers, ...
- research-articleMay 2007
Comments on "Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers"
IEEE Transactions on Computers (ITCO), Volume 56, Issue 5Pages 718–719https://doi.org/10.1109/TC.2007.1020This short report clarifies the behavior of DWCS with respect to Theorem 3 in our previously published paper [1] and describes an alternative approach to make guarantees for arbitrary window-constraints.
- research-articleFebruary 2007
A Message Scheduling Scheme for All-to-All Personalized Communication on Ethernet Switched Clusters
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 18, Issue 2Pages 264–276https://doi.org/10.1109/TPDS.2007.19We develop a message scheduling scheme for efficiently realizing all-to-all personalized communication (AAPC) on Ethernet switched clusters with one or more switches. To avoid network contention and achieve high performance, the message scheduling ...
- research-articleJune 2006
A Generic Library of Problem Solving Methods for Scheduling Applications
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 18, Issue 6Pages 815–828https://doi.org/10.1109/TKDE.2006.85In this paper, we propose a generic library of problem-solving methods for scheduling applications. Although some attempts have been made in the past at developing the libraries of scheduling problem-solvers, these only provide limited coverage. Many ...
- ArticleMay 2006
Guaranteed Maximal Matching for Input Buffered Crossbar Switches
CNSR '06: Proceedings of the 4th Annual Communication Networks and Services Research ConferencePages 213–220https://doi.org/10.1109/CNSR.2006.31While many scheduling algorithms have been proposed so far for input buffered crossbar switches, the challenge still remains to develop low complexity scheduling algorithms. These algorithms should be easy to implement and provide higher throughput and ...
- research-articleJanuary 2005
Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 11, Issue 1Pages 2–12https://doi.org/10.1109/TVCG.2005.12Three-dimensional metamorphosis is a powerful technique to produce a 3D shape transformation between two or more existing models. In this paper, we propose a novel 3D morphing technique that avoids creating a merged embedding that contains the faces, ...
- research-articleJune 2004
Comment on "A Novel Data Distribution Technique for Host-Client Type Parallel Applications'
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 15, Issue 6Page 575https://doi.org/10.1109/TPDS.2004.2Abstract--A paper by Nick Comino and V. Lakshmi Narasimhan is related to existing literature on divisible load scheduling theory.