Now showing items 1-12 of 12

    • An Approach to Scalability Study of Shared Memory Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      The overheads in a parallel system that limit its scalability need to be identified and separated in order to enable parallel algorithm design and the development of parallel machines. Such overheads may be broadly ...
    • A Comparative Evaluation of Techniques for Studying Parallel Systems 

      Sivasubramaniam, Anand; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1994)
      This paper presents a comparative and qualitative survey of techniques for evaluating parallel systems. We also survey metrics that have been proposed for capturing and quantifying the details of complex parallel ...
    • A Crow or a Blackbird?: Using True Social Network and Tweeting Behavior to Detect Malicious Entities in Twitter 

      Balasubramaniyan, Vijay A.; Maheswaran, Arjun; Mahalingam, Viswanathan; Ahamad, Mustaque; Venkateswaran, H. (Georgia Institute of Technology, 2010)
      The growing popularity of Twitter and its ability to enable near instantaneous sharing of information has made it a target of attacks by malicious entities who use it to spam and provide links to malware. There is evidence ...
    • Derandomization of Probabilistic Auxiliary Pushdown Automata Classes 

      Venkateswaran, H. (Georgia Institute of Technology, 2009)
    • A Lower Bound for Boolean Permanent in Bijective Boolean Circuits and Its Consequences 

      Sengupta, Rimli; Venkateswaran, H. (Georgia Institute of Technology, 1994)
      We identify a new and non-trivial restriction called bijectivity on Boolean circuits and prove an exponential size lower bound for computing the Boolean permanent matching function in this model. As consequences of ...
    • Lower Bounds for Perfect Matching in Restricted Boolean Circuits 

      Sengupta, Rimli; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      We consider three restrictions on Boolean circuits: bijectivity, consistency and multilinearity. Our main result is that Boolean circuits require exponential size to compute the bipartite perfect matching function when ...
    • Machine Abstractions and Locality Issues in Studying Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      We define a set of overhead functions that capture the salient artifacts representing the interaction between parallel application characteristics and architectural features. An execution-driven simulation testbed is ...
    • Multilinearity Can Be Exponentially Restrictive (Preliminary Version) 

      Sengupta, Rimli; Venkateswaran, H. (Georgia Institute of Technology, 1994)
      We define a Boolean circuit to be multilinear if the formal polynomial associated with it is multilinear as well. We consider the problem of computing the connectivity function using circuits that are monotone and ...
    • Responsive Security for Stored Data 

      Lakshmanan, Subramanian; Ahamad, Mustaque; Venkateswaran, H. (Georgia Institute of Technology, 2002)
      We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The store uses secret sharing schemes to ...
    • A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs 

      Lakshmanan, Subramanian; Ahamad, Mustaque; Venkateswaran, H. (Georgia Institute of Technology, 2000)
      As computers become pervasive in environments like the home and community, data repositories that can maintain the long term state of applications will become increasingly important. Because of the greater reliance of ...
    • A Simulation-based Scalability Study of Parallel Systems 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1993)
      Scability studies of parallel architectures have used scalar metrics to evaluate their performance. Very often, it is difficult to glean the sources of inefficiency resulting from the mismatch between the algorithmic ...
    • Synthesizing Network Requirements Using Parallel Scientific Applications 

      Sivasubramaniam, Anand; Singla, Aman; Ramachandran, Umakishore; Venkateswaran, H. (Georgia Institute of Technology, 1994)
      We synthesize the link bandwidth requirement for a binary hypercube topology using a set of five scientific applications. We use an execution-driven simulator called SPASM to collect data points for system sizes that ...