• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 120,066
Next 10 →

On the Impact of Runtime Overhead on Energy-Aware Scheduling

by Mario Bambagini, Marko Bertogna, Mauro Marinoni, Giorgio Buttazzo
"... Abstract—The real-time research community is often con-cerned with finding suitable assumptions to simplify the schedu-lability analysis of current real-time systems. This includes sim-plified power models, negligible scheduling overhead, negligible preemption cost, bounded cache misses and bus cont ..."
Abstract - Add to MetaCart
-aware scheduling algorithm. A set of simulation experiments illustrate the influence of context switch and scheduling overhead on the actual energy consumed in a given system. Results show that, in certain conditions, the penalty due to the runtime overhead might be as large as the amount of energy saved using

Cilk: An Efficient Multithreaded Runtime System

by Robert D. Blumofe , Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING , 1995
"... Cilk (pronounced "silk") is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "cri ..."
Abstract - Cited by 750 (40 self) - Add to MetaCart
Cilk (pronounced "silk") is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the "work" and "

Smart Coding using New Code Optimization Techniques in Java to Reduce Runtime Overhead of Java Compiler

by Prajakta Gotarane, Sumedh Pundkar
"... Java is a popular object oriented programming language suitable for writing Java programs. Sometimes programmers spend most of the time to increase the execution time of the program, but simultaneously its effect on code size. Therefor the code become more complex and unreliable, so this leads to re ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Java is a popular object oriented programming language suitable for writing Java programs. Sometimes programmers spend most of the time to increase the execution time of the program, but simultaneously its effect on code size. Therefor the code become more complex and unreliable, so this leads to reduce the efficiency of code. Today so many compilers are exist like c, javac,c++,cobol,etc.we studied the code optimization techniques for java compiler separately and that time we come across some new code optimization strategies which is the smart way to do the coding in java. In this paper we applied some new java code optimization techniques on existing code. We verify the code optimization, performance using our executor. These code optimization strategies indirectly help to reduce the work of garbage collection, data structure and also work on loop optimization. So the results which we found after doing experimentations are quite satisfactory as compare to original results. so these techniques are help to improve the code quality.

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

by Edward Ashford Lee, David G. Messerschmitt - IEEE TRANSACTIONS ON COMPUTERS , 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract - Cited by 592 (37 self) - Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake

Safe Kernel Extensions Without Run-Time Checking

by George C. Necula, Peter Lee - Proc. of OSDI'96
"... Abstract This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel first defines a safety policy and makes it public. Then, using this policy, an application can provide binaries i ..."
Abstract - Cited by 437 (20 self) - Add to MetaCart
assembly language, and then generated PCC binaries for them using a special prototype assembler. The PCC binaries can be executed with no run-time overhead, beyond a one-time cost of 1 to 3 milliseconds for validating the enclosed proofs. The net result is that our packet filters are formally guaranteed

The implementation of the cilk-5 multithreaded language

by Matteo Frigo, Charles E. Leiserson, Keith H. Randall - In PLDI ’98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation , 1998
"... The fth release of the multithreaded language Cilk uses a provably good \work-stealing " scheduling algorithm similar to the rst system, but the language has been completely re-designed and the runtime system completely reengineered. The eciency of the new implementation was aided by a clear st ..."
Abstract - Cited by 493 (30 self) - Add to MetaCart
The fth release of the multithreaded language Cilk uses a provably good \work-stealing " scheduling algorithm similar to the rst system, but the language has been completely re-designed and the runtime system completely reengineered. The eciency of the new implementation was aided by a clear

Synchronous data flow

by Edward A. Lee, et al. , 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract - Cited by 621 (46 self) - Add to MetaCart
of data flow (either atomic or large grain) in which the number of data samples produced or consumed by each node on each invocation is specified a priori. Nodes can be scheduled statically (at compile time) onto single or parallel programmable processors so the run-time overhead usually associated

Composable memory transactions

by Tim Harris, Mark Plesko, Avraham Shinnar, David Tarditi - In Symposium on Principles and Practice of Parallel Programming (PPoPP , 2005
"... Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement atomic blocks over word-based transactional memory that provides scalable multiprocessor performance without requiring changes ..."
Abstract - Cited by 506 (42 self) - Add to MetaCart
repeatedly in an atomic block), (3) we use runtime filtering to detect duplicate log entries that are missed statically, and (4) we present a series of GC-time techniques to compact the logs generated by long-running atomic blocks. Our implementation supports short-running scalable concurrent benchmarks

Route Packets, Not Wires: On-Chip Interconnection Networks

by William J. Dally, Brian Towles , 2001
"... Using on-chip interconnection networks in place of ad-hoc global wiring structures the top level wires on a chip and facilitates modular design. With this approach, system modules (processors, memories, peripherals, etc...) communicate by sending packets to one another over the network. The structur ..."
Abstract - Cited by 864 (10 self) - Add to MetaCart
. The structured network wiring gives well-controlled electrical parameters that eliminate timing iterations and enable the use of high-performance circuits to reduce latency and increase bandwidth. The area overhead required to implement an on-chip network is modest, we estimate 6.6%. This paper introduces

TaintDroid: An Information-Flow Tracking System for Realtime Privacy Monitoring on Smartphones

by William Enck, Landon P. Cox, Jaeyeon Jung, et al. , 2010
"... Today’s smartphone operating systems fail to provide users with adequate control and visibility into how third-party applications use their private data. We present TaintDroid, an efficient, system-wide dynamic taint tracking and analysis system for the popular Android platform that can simultaneous ..."
Abstract - Cited by 498 (23 self) - Add to MetaCart
simultaneously track multiple sources of sensitive data. TaintDroid’s efficiency to perform real-time analysis stems from its novel system design that leverages the mobile platform’s virtualized system architecture. TaintDroid incurs only 14 % performance overhead on a CPU-bound micro-benchmark with little
Next 10 →
Results 1 - 10 of 120,066
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University