%0 Conference Paper
%B 2011 Proceedings IEEE INFOCOM
%D 2011
%T Approximation algorithms for throughput maximization in wireless networks with delay constraints
%A Guanhong Pei
%A Anil Kumar,V. S
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K Approximation algorithms
%K Approximation methods
%K approximation theory
%K Delay
%K delay constraints
%K delays
%K general interference model
%K Interference
%K multihop wireless networks
%K optimisation
%K Optimized production technology
%K radio networks
%K radiofrequency interference
%K target delay bound
%K Throughput
%K throughput maximization
%K Wireless networks
%X We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant tradeoff between the end-to-end delays and the total achievable rate. We develop algorithms to compute such tradeoffs with provable performance guarantees for arbitrary instances, with general interference models. Given a target delay-bound Δ(c) for each session c, our algorithm gives a stable flow vector with a total throughput within a factor of O (logΔm/log log Δm) of the maximum, so that the per-session (end-to-end) delay is O ((logΔm/log log Δm Δ(c))2), where Δm = maxc{Δ(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.
%B 2011 Proceedings IEEE INFOCOM
%I IEEE
%P 1116 - 1124
%8 2011/04/10/15
%@ 978-1-4244-9919-9
%G eng
%R 10.1109/INFCOM.2011.5934887
%0 Conference Paper
%B 2011 IEEE Workshop on Signal Processing Systems (SiPS)
%D 2011
%T Vectorization and mapping of software defined radio applications on heterogeneous multi-processor platforms
%A Zaki, G.F.
%A Plishker,W.
%A Bhattacharyya, Shuvra S.
%A Clancy, C.
%A Kuykendall, J.
%K Benchmark testing
%K block processing
%K Design methodology
%K formal description
%K GNU radio environment
%K Graphic Processor Unit
%K Graphics processing unit
%K heterogeneous multiprocessor platform
%K mapping problem
%K Multicore processing
%K Multiprocessing systems
%K multiprocessor architecture
%K multiprocessor scheduling
%K operating systems (computers)
%K PARALLEL PROCESSING
%K Processor scheduling
%K Schedules
%K SIMD core
%K Software Defined Radio
%K software defined radio system design
%K software radio
%K telecommunication computing
%K Throughput
%K vectorization
%K workflow
%X A variety of multiprocessor architectures have proliferated even for off-the-shelf computing platforms. To improve performance and productivity for common heterogeneous systems, we have developed a workflow to generate efficient solutions. By starting with a formal description of an application and the mapping problem we are able to generate a range of designs that efficiently trade-of latency and throughput. In this approach, efficient utilization of SIMD cores is achieved by applying extensive block processing in conjunction with efficient mapping and scheduling. We demonstrate our approach through an integration into the GNU Radio environment for software defined radio system design.
%B 2011 IEEE Workshop on Signal Processing Systems (SiPS)
%P 31 - 36
%8 2011
%G eng
%0 Conference Paper
%B 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
%D 2010
%T Decentralized dynamic scheduling across heterogeneous multi-core desktop grids
%A Jaehwan Lee
%A Keleher,P.
%A Sussman, Alan
%K backfill jobs
%K bounded waiting time
%K Computer science
%K decentralized dynamic scheduling
%K desktop grid resource management
%K Dynamic scheduling
%K Educational institutions
%K Environmental management
%K grid computing
%K heterogeneous multicore desktop grid
%K job assignment
%K job migration
%K load balancing
%K Load management
%K multicore computing environment
%K Peer to peer computing
%K Processor scheduling
%K residual resources
%K resource allocation
%K Resource management
%K scheduling
%K Scheduling algorithm
%K Throughput
%X The recent advent of multi-core computing environments increases both the heterogeneity and complexity of managing desktop grid resources, making efficient load balancing challenging even for a centralized manager. Even with good initial job assignments, dynamic scheduling is still needed to adapt to dynamic environments, as well as for applications whose running times are not known a priori. In this paper, we propose new decentralized scheduling schemes that backfill jobs locally and dynamically migrate waiting jobs across nodes to leverage residual resources, while guaranteeing bounded waiting times for all jobs. The methods attempt to maximize total throughput while balancing load across available grid resources. Experimental results via simulation show that our scheduling scheme has performance competitive with an online centralized scheduler.
%B 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
%I IEEE
%P 1 - 9
%8 2010/04/19/23
%@ 978-1-4244-6533-0
%G eng
%R 10.1109/IPDPSW.2010.5470877
%0 Conference Paper
%B 2010 International Conference on Embedded Computer Systems (SAMOS)
%D 2010
%T Efficient static buffering to guarantee throughput-optimal FPGA implementation of synchronous dataflow graphs
%A Kee, Hojin
%A Bhattacharyya, Shuvra S.
%A Kornerup, J.
%K buffer memory
%K circuit complexity
%K Complexity theory
%K Computational modeling
%K data flow graphs
%K Digital signal processing
%K digital signal processing chips
%K DSP system design
%K efficient static buffering
%K Field programmable gate arrays
%K FPGA
%K graph buffer distributions
%K integrated circuit design
%K low polynomial time complexity
%K Random access memory
%K Schedules
%K SDF graph edges
%K Signal processing systems
%K Synchronous dataflow
%K synchronous dataflow graph mapping
%K Throughput
%K throughput-optimal execution
%K throughput-optimal FPGA implementation
%K two-actor SDF graph model
%K upper bounds
%X When designing DSP applications for implementation on field programmable gate arrays (FPGAs), it is often important to minimize consumption of limited FPGA resources while satisfying real-time performance constraints. In this paper, we develop efficient techniques to determine dataflow graph buffer sizes that guarantee throughput-optimal execution when mapping synchronous dataflow (SDF) representations of DSP applications onto FPGAs. Our techniques are based on a novel two-actor SDF graph Model (TASM), which efficiently captures the behavior and costs associated with SDF graph edges (flow-graph connections). With our proposed techniques, designers can automatically generate upper bounds on SDF graph buffer distributions that realize maximum achievable throughput performance for the corresponding applications. Furthermore, our proposed technique is characterized by low polynomial time complexity, which is useful for rapid prototyping in DSP system design.
%B 2010 International Conference on Embedded Computer Systems (SAMOS)
%P 136 - 143
%8 2010
%G eng
%0 Conference Paper
%B IEEE INFOCOM 2009
%D 2009
%T Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks
%A Han,Bo
%A Kumar,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K access hash function
%K Channel allocation
%K channel assignment algorithm
%K channel capacity
%K collision avoidance
%K Computer science
%K cryptography
%K distributed algorithm
%K distributed algorithms
%K Educational institutions
%K inductive-scheduling technique
%K Interference
%K interference set
%K packet scheduling algorithm
%K Peer to peer computing
%K Radio network
%K radio networks
%K radiofrequency interference
%K random oracle methodology
%K scheduling
%K Scheduling algorithm
%K simultaneous channel allocation
%K software radio
%K software-defined radio wireless network capacity
%K telecommunication congestion control
%K telecommunication security
%K Throughput
%K wireless channels
%K Wireless networks
%X Equipping wireless nodes with multiple radios can significantly increase the capacity of wireless networks, by making these radios simultaneously transmit over multiple non-overlapping channels. However, due to the limited number of radios and available orthogonal channels, designing efficient channel assignment and scheduling algorithms in such networks is a major challenge. In this paper, we present provably-good distributed algorithms for simultaneous channel allocation of individual links and packet-scheduling, in software-defined radio (SDR) wireless networks. Our distributed algorithms are very simple to implement, and do not require any coordination even among neighboring nodes. A novel access hash function or random oracle methodology is one of the key drivers of our results. With this access hash function, each radio can know the transmitters' decisions for links in its interference set for each time slot without introducing any extra communication overhead between them. Further, by utilizing the inductive-scheduling technique, each radio can also backoff appropriately to avoid collisions. Extensive simulations demonstrate that our bounds are valid in practice.
%B IEEE INFOCOM 2009
%I IEEE
%P 1521 - 1529
%8 2009/04/19/25
%@ 978-1-4244-3512-8
%G eng
%R 10.1109/INFCOM.2009.5062069
%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
%A Chafekar,D.
%A Kumart,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K Algorithm design and analysis
%K approximation algorithm
%K Approximation algorithms
%K approximation theory
%K Computer networks
%K Computer science
%K graph theory
%K graph-based model
%K Interference constraints
%K polynomial time algorithm
%K Propagation losses
%K Protocols
%K radio networks
%K radiofrequency interference
%K signal to interference plus noise ratio
%K Signal to noise ratio
%K Throughput
%K wireless interference
%K wireless network
%K Wireless networks
%X A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1166 - 1174
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.172
%0 Conference Paper
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%D 2008
%T Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
%A Chafekar,D.
%A Levin,D.
%A Kumar,V. S.A
%A Marathe,M. V
%A Parthasarathy,S.
%A Srinivasan, Aravind
%K asynchronous random-access scheduling
%K channel access probability
%K Computer networks
%K Computer science
%K Educational institutions
%K Interference
%K Optimal scheduling
%K Peer to peer computing
%K probability
%K Processor scheduling
%K radio link
%K radio links
%K radio networks
%K Routing
%K scheduling
%K Throughput
%K throughput capacity
%K wireless channels
%K Wireless networks
%X We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question we answer is: how should we set the channel-access probability for each link in the network so that the network operates close to its optimal throughput capacity? We design simple and distributed channel-access strategies for random-access networks which are provably competitive with respect to the optimal scheduling strategy, which is deterministic, centralized, and computationally infeasible. We show that the competitiveness of our strategies are nearly the best achievable via random-access scheduling, thus establishing fundamental limits on the performance of random- access. A notable outcome of our work is that random access compares well with deterministic scheduling when link transmission durations differ by small factors, and much worse otherwise. The distinguishing aspects of our work include modeling and rigorous analysis of asynchronous communication, asymmetry in link transmission durations, and hidden terminals under arbitrary link-conflict based wireless interference models.
%B IEEE INFOCOM 2008. The 27th Conference on Computer Communications
%I IEEE
%P 1148 - 1156
%8 2008/04/13/18
%@ 978-1-4244-2025-4
%G eng
%R 10.1109/INFOCOM.2008.170
%0 Conference Paper
%B IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008
%D 2008
%T Network-Aware Join Processing in Global-Scale Database Federations
%A Xiaodan Wang
%A Burns,R.
%A Terzis,A.
%A Deshpande, Amol
%K Astronomy
%K Computer networks
%K Concurrent computing
%K global-scale database federations
%K join scheduling algorithms
%K network utilization
%K network-aware join processing
%K parallel schedules
%K polynomial-time algorithm
%K Polynomials
%K Processor scheduling
%K Query processing
%K reduce resource usage
%K Scheduling algorithm
%K Spatial databases
%K spatial-join queries
%K Telecommunication traffic
%K Throughput
%X We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation. This metric allows algorithms to exploit excess capacity in the network, while avoiding narrow, long-haul paths. We give a two- approximate, polynomial-time algorithm for serial (left-deep) join schedules. We also present extensions to this algorithm that explore parallel schedules, reduce resource usage, and define tradeoffs between computation and network utilization. We evaluate these techniques within the SkyQuery federation of Astronomy databases using spatial-join queries submitted by SkyQuery's users. Experiments show that our algorithms realize near-optimal network utilization with minor computational overhead.
%B IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008
%I IEEE
%P 586 - 595
%8 2008/04/07/12
%@ 978-1-4244-1836-7
%G eng
%R 10.1109/ICDE.2008.4497467
%0 Journal Article
%J IEEE Transactions on Signal Processing
%D 2006
%T Contention-conscious transaction ordering in multiprocessor DSP systems
%A Khandelia,M.
%A Bambha,N. K
%A Bhattacharyya, Shuvra S.
%K contention-conscious transaction ordering
%K Costs
%K data flow graphs
%K Dataflow
%K Delay
%K Digital signal processing
%K digital signal processing chips
%K Embedded system
%K graph-theoretic analysis
%K Instruments
%K Internet telephony
%K interprocessor communication
%K iterative dataflow graphs
%K iterative methods
%K Message passing
%K multiprocessor
%K multiprocessor DSP systems
%K NP-complete problem
%K Processor scheduling
%K scheduling
%K Signal processing
%K synchronization
%K Throughput
%X This paper explores the problem of efficiently ordering interprocessor communication (IPC) operations in statically scheduled multiprocessors for iterative dataflow graphs. In most digital signal processing (DSP) applications, the throughput of the system is significantly affected by communication costs. By explicitly modeling these costs within an effective graph-theoretic analysis framework, we show that ordered transaction schedules can significantly outperform self-timed schedules even when synchronization costs are low. However, we also show that when communication latencies are nonnegligible, finding an optimal transaction order given a static schedule is an NP-complete problem, and that this intractability holds both under iterative and noniterative execution. We develop new heuristics for finding efficient transaction orders, and perform an extensive experimental comparison to gauge the performance of these heuristics.
%B IEEE Transactions on Signal Processing
%V 54
%P 556 - 569
%8 2006/02//
%@ 1053-587X
%G eng
%N 2
%R 10.1109/TSP.2005.861074
%0 Conference Paper
%B 2005 IEEE International Conference on Systems, Man and Cybernetics
%D 2005
%T A learning automata based power management for ad-hoc networks
%A El-Osery,A. I
%A Baird,D.
%A Abd-Almageed, Wael
%K ad hoc networks
%K ad-hoc networks
%K Computer network management
%K Computer networks
%K Energy management
%K Engineering management
%K learning automata
%K network metrics
%K network simulator
%K packet retransmissions
%K power control
%K power system management
%K power transmission control
%K stochastic learning automata
%K stochastic learning automta
%K Stochastic processes
%K system bandwidth
%K Technology management
%K Throughput
%K transmission power control
%K transmission power level
%K transmission power management
%X Power management is a very important aspect of ad-hoc networks. It directly impacts the network throughput among other network metrics. On the other hand, transmission power management may result in disconnected networks and increased level of collisions. In this paper, we introduce a transmission power control based on stochastic learning automata (SLA) to modify the transmission power. Based on the level of successful transmissions and the level of packet retransmissions, the SLA will modify the transmission power level either by increasing it or decreasing it. The probabilistic nature of SLA makes it a useful choice for ad-hoc networks. Using the network simulator NS, we show that using SLA for transmission power will result in an increased system bandwidth and a decrease in the collision levels.
%B 2005 IEEE International Conference on Systems, Man and Cybernetics
%I IEEE
%V 4
%P 3569- 3573 Vol. 4 - 3569- 3573 Vol. 4
%8 2005/10//
%@ 0-7803-9298-1
%G eng
%R 10.1109/ICSMC.2005.1571701
%0 Conference Paper
%B Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th
%D 2004
%T Achieving packet-level quality of service through scheduling in multirate WLANs
%A Yuan Yuan
%A Daqing Gu
%A Arbaugh, William A.
%A Jinyun Zhang
%K Analytical models
%K channel conditions
%K channel errors
%K channel temporal fair share
%K compensation
%K Computer science
%K Delay
%K error-prone flow compensation
%K IEEE 802.11a/b/g physical layer
%K multirate wireless fair scheduling
%K multirate WLAN
%K packet radio networks
%K packet-level quality of service
%K Physical layer
%K Processor scheduling
%K QoS
%K quality of service
%K radio access networks
%K Scheduling algorithm
%K Throughput
%K throughput fairness
%K USA Councils
%K Wireless LAN
%K wireless packet scheduling
%K WMFS
%X Wireless packet scheduling has been a popular paradigm to achieve packet-level QoS in terms of fairness and throughput in the presence of channel errors. However, the current design does not anticipate the multi-rate capability offered by the IEEE 802.11a/b/g physical layer, thus suffering significant performance degradation in 802.11 WLANs. In this paper, we propose multirate wireless fair scheduling (WMFS). In MWFS, each flow is granted a temporal fair share of the channel, in contrast to the throughput fair share adopted by existing algorithms. Therefore, each flow receives services in proportion to its perceived transmission rate, and high-rate flows are able to opportunistically exploit their good channel conditions and receive more services. MWFS also renovates the compensation model in order to allow for error-prone flows to catch up, thus ensuring fairness for all flows over error-prone channels. We demonstrate the effectiveness of MWFS through both simulations and analysis. Especially, WMFS achieves system throughput 159% of state-of-the-art scheduling algorithms in simulated scenarios.
%B Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60th
%I IEEE
%V 4
%P 2730- 2734 Vol. 4 - 2730- 2734 Vol. 4
%8 2004/09/26/29
%@ 0-7803-8521-7
%G eng
%R 10.1109/VETECF.2004.1400554
%0 Conference Paper
%B 13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings
%D 2004
%T Automated cluster-based Web service performance tuning
%A Chung,I. -H
%A Hollingsworth, Jeffrey K
%K Active Harmony system
%K automated performance tuning
%K business
%K cluster-based Web service system
%K Clustering algorithms
%K Computer science
%K Educational institutions
%K electronic commerce
%K Internet
%K Middleware
%K performance evaluation
%K scalability
%K Throughput
%K Transaction databases
%K Web server
%K Web services
%K workstation clusters
%X Active harmony provides a way to automate performance tuning. We apply the Active Harmony system to improve the performance of a cluster-based web service system. The performance improvement cannot easily be achieved by tuning individual components for such a system. The experimental results show that there is no single configuration for the system that performs well for all kinds of workloads. By tuning the parameters, Active Harmony helps the system adapt to different workloads and improve the performance up to 16%. For scalability, we demonstrate how to reduce the time when tuning a large system with many tunable parameters. Finally an algorithm is proposed to automatically adjust the structure of cluster-based web systems, and the system throughput is improved up to 70% using this technique.
%B 13th IEEE International Symposium on High performance Distributed Computing, 2004. Proceedings
%I IEEE
%P 36 - 44
%8 2004/06/04/6
%@ 0-7695-2175-4
%G eng
%R 10.1109/HPDC.2004.1323484
%0 Conference Paper
%B 13th International Conference on Computer Communications and Networks, 2004. ICCCN 2004. Proceedings
%D 2004
%T High-performance MAC for high-capacity wireless LANs
%A Yuan Yuan
%A Daqing Gu
%A Arbaugh, William A.
%A Jinyun Zhang
%K 35 Mbit/s
%K access protocols
%K Aggregates
%K Bandwidth
%K batch transmission
%K Computer science
%K Educational institutions
%K high-capacity wireless LAN
%K high-performance MAC
%K Laboratories
%K Local area networks
%K Media Access Protocol
%K opportunistic selection
%K Physical layer
%K probability
%K Throughput
%K Wireless LAN
%X The next-generation wireless technologies, e.g., 802.11n and 802.15.3a, offer a physical-layer speed at least an-order-of-magnitude higher than the current standards. However, direct application of current MACs leads to high protocol overhead and significant throughput degradation. In this paper, we propose ADCA, a high-performance MAC that works with high-capacity physical layer. ADCA exploits two ideas of adaptive batch transmission and opportunistic selection of high-rate hosts to simultaneously reduce the overhead and improve the aggregate throughput. It opportunistically favors high-rate hosts by providing higher access probability and more access time, while ensuring each low-rate host certain minimum amount of channel access time. Simulations show that the ADCA design increases the throughput by 112% and reduces the average delay by 55% compared with the legacy DCF. It delivers more than 100 Mbps MAC-layer throughput as compared with 35 Mbps offered by the legacy MAC
%B 13th International Conference on Computer Communications and Networks, 2004. ICCCN 2004. Proceedings
%I IEEE
%P 167 - 172
%8 2004/10/11/13
%@ 0-7803-8814-3
%G eng
%R 10.1109/ICCCN.2004.1401615
%0 Conference Paper
%B Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
%D 2004
%T Unobtrusiveness and efficiency in idle cycle stealing for PC grids
%A Ryu, K. D
%A Hollingsworth, Jeffrey K
%K Biological system modeling
%K Computational modeling
%K Computer science
%K Computer simulation
%K Contracts
%K desktop grid system
%K fine-grain cycle stealing approach
%K grid computing
%K idle cycle stealing
%K Linger-Longer system
%K Linux
%K Linux cluster
%K microcomputers
%K PC grids
%K Personal communication networks
%K Prototypes
%K resource allocation
%K Throughput
%K workstation clusters
%K workstation grid systems
%K Workstations
%X Summary form only given. Studies have shown that for a significant fraction of the time desktop PCs and workstations are under-utilized. To exploit these idle resources, various desktop/workstation grid systems have been developed. The ultimate goal of such systems is to maximize efficiency of resource usage while maintaining low obtrusiveness to machine owners. To this end, we created a new fine-grain cycle stealing approach and conducted a performance comparison study against the traditional coarse-grain cycle stealing. We developed a prototype of fine-grain cycle stealing, the Linger-Longer system, on a Linux cluster. The experiments on a cluster of desktop Linux PCs with benchmark applications show that, overall, fine-grain cycle stealing can improve efficiency of idle cycle usage by increasing the guest job throughput by 50% to 70%, while limiting obtrusiveness with no more than 3% of host job slowdown.
%B Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
%I IEEE
%8 2004/04/26/30
%@ 0-7695-2132-0
%G eng
%R 10.1109/IPDPS.2004.1302987
%0 Journal Article
%J IEEE Transactions on Parallel and Distributed Systems
%D 2000
%T Exploiting fine-grained idle periods in networks of workstations
%A Kyung Dong Ryu
%A Hollingsworth, Jeffrey K
%K cluster of workstations
%K Computer networks
%K Concurrent computing
%K Contracts
%K Delay
%K fine-grained availability
%K Intelligent networks
%K Linger-Longer
%K networks of workstations
%K PARALLEL PROCESSING
%K Predictive models
%K Processor scheduling
%K Resumes
%K scheduling policy
%K Throughput
%K workload characterization
%K workstation clusters
%K Workstations
%X Studies have shown that for a significant fraction of the time, workstations are idle. In this paper, we present a new scheduling policy called Linger-Longer that exploits the fine-grained availability of workstations to run sequential and parallel jobs. We present a two-level workload characterization study and use it to simulate a cluster of workstations running our new policy. We compare two variations of our policy to two previous policies: Immediate-Eviction and Pause-and-Migrate. Our study shows that the Linger-Longer policy can improve the throughput of foreign jobs on a cluster by 60 percent with only a 0.5 percent slowdown of local jobs. For parallel computing, we show that the Linger-Longer policy outperforms reconfiguration strategies when the processor utilization by the local process is 20 percent or less in both synthetic bulk synchronous and real data-parallel applications
%B IEEE Transactions on Parallel and Distributed Systems
%V 11
%P 683 - 698
%8 2000/07//
%@ 1045-9219
%G eng
%N 7
%R 10.1109/71.877793
%0 Conference Paper
%B IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings
%D 2000
%T Receiver based management of low bandwidth access links
%A Spring, Neil
%A Chesire,M.
%A Berryman,M.
%A Sahasranaman,V.
%A Anderson,T.
%A Bershad,B.
%K Bandwidth
%K buffer storage
%K bulk-transfer applications
%K complex Web page
%K congestion control policy
%K Delay
%K dynamically loadable Linux kernel module
%K information resources
%K interactive network
%K Internet
%K Kernel
%K link utilization
%K Linux
%K low-bandwidth access links
%K mixed traffic load
%K packet latency
%K queue length
%K queueing theory
%K receive socket buffer sizes
%K receiver-based management
%K response time
%K short flow prioritizing
%K Size control
%K Sockets
%K subscriber loops
%K TCP flow control
%K telecommunication congestion control
%K telecommunication network management
%K Telecommunication traffic
%K Testing
%K Throughput
%K Transport protocols
%K Unix
%K Web pages
%X In this paper, we describe a receiver-based congestion control policy that leverages TCP flow control mechanisms to prioritize mixed traffic loads across access links. We manage queueing at the access link to: (1) improve the response time of interactive network applications; (2) reduce congestion-related packet losses; while (3) maintaining high throughput for bulk-transfer applications. Our policy controls queue length by manipulating receive socket buffer sizes. We have implemented this solution in a dynamically loadable Linux kernel module, and tested it over low-bandwidth links. Our approach yields a 7-fold improvement in packet latency over an unmodified system while maintaining 94% link utilization. In the common case, congestion-related packet losses at the access link can be eliminated. Finally, by prioritizing short flows, we show that our system reduces the time to download a complex Web page during a large background transfer by a factor of two
%B IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings
%I IEEE
%V 1
%P 245-254 vol.1 - 245-254 vol.1
%8 2000///
%@ 0-7803-5880-5
%G eng
%R 10.1109/INFCOM.2000.832194
%0 Conference Paper
%B Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings
%D 1999
%T Network service selection for distributed multimedia applications
%A Simon,R.
%A Sood,A.
%A Mundur, Padma
%K Admission control
%K Application software
%K application-adequate end-to-end service
%K Bandwidth
%K Communication system traffic control
%K Computer science
%K Delay
%K distributed processing
%K end-to-end delivery delay control
%K flexibility
%K high-bandwidth distributed multimedia applications
%K interactive multimedia
%K multimedia systems
%K network service selection
%K network throughput
%K nonpreemptive earliest deadline first
%K queueing theory
%K Regulators
%K system support
%K telecommunication services
%K Throughput
%K Traffic control
%K weighted fair queueing
%X An important question in the development of system support for distributed multimedia is the type of network service offered to applications. This paper compares two network service disciplines: weighted fair queueing (WFQ) and non-preemptive earliest deadline first (NEDF). We show that, for a broad class of high-bandwidth distributed multimedia applications, WFQ outperforms NEDF in terms of network throughput while still providing an application-adequate end-to-end service. This result holds despite the fact that NEDF offers applications far greater flexibility in terms of control over end-to-end delivery delay
%B Third International Conference on Computational Intelligence and Multimedia Applications, 1999. ICCIMA '99. Proceedings
%I IEEE
%P 388 - 392
%8 1999///
%@ 0-7695-0300-4
%G eng
%R 10.1109/ICCIMA.1999.798561
%0 Journal Article
%J IEEE Transactions on Software Engineering
%D 1993
%T Performance comparison of three modern DBMS architectures
%A Delis,A.
%A Roussopoulos, Nick
%K client-server
%K Computational modeling
%K Computer architecture
%K database management systems
%K DBMS architectures
%K design rationales
%K functional components
%K Indexes
%K Local area networks
%K Military computing
%K Packaging
%K Performance analysis
%K performance evaluation
%K RAD-UNIFY type
%K simulation models
%K simulation results
%K Software architecture
%K software architecture configurations
%K software engineering
%K Throughput
%K Workstations
%X The introduction of powerful workstations connected through local area networks (LANs) inspired new database management system (DBMS) architectures that offer high performance characteristics. The authors examine three such software architecture configurations: client-server (CS), the RAD-UNIFY type of DBMS (RU), and enhanced client-server (ECS). Their specific functional components and design rationales are discussed. Three simulation models are used to provide a performance comparison under different job workloads. Simulation results show that the RU almost always performs slightly better than the CS, especially under light workloads, and that ECS offers significant performance improvement over both CS and RU. Under reasonable update rates, the ECS over CS (or RU) performance ratio is almost proportional to the number of participating clients (for less than 32 clients). The authors also examine the impact of certain key parameters on the performance of the three architectures and show that ECS is more scalable that the other two
%B IEEE Transactions on Software Engineering
%V 19
%P 120 - 138
%8 1993/02//
%@ 0098-5589
%G eng
%N 2
%R 10.1109/32.214830