Sciweavers

144 search results - page 17 / 29
» Throughput Analysis of Synchronous Data Flow Graphs
Sort
View
ASE
2004
127views more  ASE 2004»
13 years 7 months ago
Precise Call Graphs for C Programs with Function Pointers
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
PLDI
1994
ACM
13 years 11 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
COMCOM
2008
111views more  COMCOM 2008»
13 years 7 months ago
An admission control algorithm for multi-hop 802.11e-based WLANs
Recently, wireless local area network (WLAN) hotspots have been deployed in many areas (e.g., cafes, airports, university campuses). The new IEEE 802.11e standard further provides...
Yuxia Lin, Vincent W. S. Wong
EMSOFT
2005
Springer
14 years 1 months ago
Communication strategies for shared-bus embedded multiprocessors
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
Neal K. Bambha, Shuvra S. Bhattacharyya
PPOPP
2010
ACM
14 years 5 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...