Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Gopalan, N.P."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Proficient speculative execution model for SQL statements
    (2013) Suma, S.; Gopalan, N.P.
    Enforcing transaction consistency, data integrity and security specifications lead to the creation and manipulation of the data in all the commercial applications. Speculative execution is a technique implemented for reducing the dependences in the high performance microprocessors which supports the hardware and software techniques. Speculative parallelism exploits the instruction level parallelism, increases utilization and the granularity of the code. In this paper we are proposing a proficient execution model for the execution of the SQL statements with the speculative multithreaded processors and a thread spawning scheme for this model on Multicores. A mathematical formulation to reduce CPU time and memory requirements is dealt to make the analysis. � 2013 IEEE.
  • No Thumbnail Available
    Item
    Proficient speculative execution model for SQL statements
    (IEEE Computer Society help@computer.org, 2013) Suma, S.; Gopalan, N.P.
    Enforcing transaction consistency, data integrity and security specifications lead to the creation and manipulation of the data in all the commercial applications. Speculative execution is a technique implemented for reducing the dependences in the high performance microprocessors which supports the hardware and software techniques. Speculative parallelism exploits the instruction level parallelism, increases utilization and the granularity of the code. In this paper we are proposing a proficient execution model for the execution of the SQL statements with the speculative multithreaded processors and a thread spawning scheme for this model on Multicores. A mathematical formulation to reduce CPU time and memory requirements is dealt to make the analysis. © 2013 IEEE.
  • Thumbnail Image
    Item
    Speech synthesizer with speculative multithreading and speculative computation reuse
    (2013) Suma, S.; Gopalan, N.P.
    Speculative multithreading and speculative computation reuse uses profiles for exploiting and to increase the cache memory performance. Currently proposed multithreaded processors try to improve on execution of number of instructions in each clock cycle. Even the general purpose applications can enchance the Instruction level parallelism through these techniques. Hence in this paper we are proposing an idea of the hybrid technique of both multithreading and instruction reuse to enhance the performance and execution rate comparatively with the sequential computation. We are also computing the thread interval for the reliability testing such that at what interval the value to be passed from the producer thread to the consumer thread. � 2013 IEEE.
  • No Thumbnail Available
    Item
    Speech synthesizer with speculative multithreading and speculative computation reuse
    (IEEE Computer Society help@computer.org, 2013) Suma, S.; Gopalan, N.P.
    Speculative multithreading and speculative computation reuse uses profiles for exploiting and to increase the cache memory performance. Currently proposed multithreaded processors try to improve on execution of number of instructions in each clock cycle. Even the general purpose applications can enchance the Instruction level parallelism through these techniques. Hence in this paper we are proposing an idea of the hybrid technique of both multithreading and instruction reuse to enhance the performance and execution rate comparatively with the sequential computation. We are also computing the thread interval for the reliability testing such that at what interval the value to be passed from the producer thread to the consumer thread. © 2013 IEEE.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify