Filters








74,813 Hits in 4.9 sec

Optimization of Information Rate Upper and Lower Bounds for Channels With Memory

Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams
2009 IEEE Transactions on Information Theory  
We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory.  ...  We provide an explicit, iterative algorithm that improves the upper bound at each iteration. We also provide an effective method for iteratively optimizing the lower bound.  ...  for their constructive comments.  ... 
doi:10.1109/tit.2008.2009581 fatcat:gfqct7fnmndrvli4h6upd764um

Integrated analysis of communicating tasks in MPSoCs

Simon Schliecker, Matthias Ivers, Rolf Ernst
2006 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis - CODES+ISSS '06  
Especially memory accesses and co-processor calls over shared communication networks, basic operations of every embedded application pose a challenge for precise system analysis.  ...  For both, we present a precise response time analysis. Finally, we compare the scheduling techniques with respect to real-time requirements.  ...  It can be kept from executing by lower priority tasks and their requests maximally for a time bounded by Bi.  ... 
doi:10.1145/1176254.1176325 dblp:conf/codes/SchlieckerIE06 fatcat:jqpspxpumfarbd7xdgo3ixrh3i

Bounding the effect of partition camping in GPU kernels

Ashwin M. Aji, Mayank Daga, Wu-chun Feng
2011 Proceedings of the 8th ACM International Conference on Computing Frontiers - CF '11  
Partition Camping is caused by memory accesses that are skewed towards a subset of the available memory partitions, which may degrade the performance of GPU kernels by up to seven-fold.  ...  Unlike the traditional performance modeling approaches, we predict a performance range that bounds the partition camping effect in the GPU kernel.  ...  We would also like to thank Balaji Subramaniam for helping us with the statistical analysis of our micro-benchmark results.  ... 
doi:10.1145/2016604.2016637 dblp:conf/cf/AjiDF11 fatcat:oinhvyp4qjbpzbtr6yfrrou4oi

Approximate mining of frequent patterns on streams

Claudio Silvestri, Salvatore Orlando, João Gama, Jesus Aguilar-Ruiz
2007 Intelligent Data Analysis  
This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory.  ...  Both upper and lower bounds on the support of each pattern found are returned along with the interpolated support.  ...  The lower and upper bounds for the support of pattern AB will be respectively 5 + 0 + 2 = 7 and 7 + 4 + 6 = 17. h(tid)=0 h(tid)=1 h(tid)=2 Both lower bounds and upper bounds computations can be extended  ... 
doi:10.3233/ida-2007-11104 fatcat:d4g3uvnfmnczlkd537ax4bdt2i

Exploiting dynamic transaction queue size in scalable memory systems

Mario Donato Marino, Tien-Hsiung Weng, Kuan-Ching Li
2017 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
Nevertheless, a number of researches have pointed out that, even executing bandwidth-bound applications in systems with larger number of MCs, the number of transaction queue entries is under-utilized -  ...  In order to increase parallelism via memory width in scalable memory systems, a straightforward approach is to employ larger number of memory controllers (MCs).  ...  An example for intense memory-bound applications are STREAM [12] and pChase [13] , where the number of memory transactions entries occupied is reduced up to 5 times when scaling the number of MCs/ranks  ... 
doi:10.1007/s00500-016-2470-x fatcat:cthoj7tnd5gmlofmqod56xaehu

Implications of shallower memory controller transaction queues in scalable memory systems

Mario D. Marino, Kuan-Ching Li
2015 Journal of Supercomputing  
In these systems, as memory controllers (MCs) are scaled, memory traffic per MC is reduced, so transaction queues become shallower.  ...  Scalable memory systems provide scalable bandwidth to the core growth demands in multicores and embedded systems processors.  ...  ACKNOWLEDGEMENTS We would like to thank Maria Amelia Guitti Marino and anonymous reviewers for their important feedbacks, discussions, and suggestions.  ... 
doi:10.1007/s11227-015-1485-x fatcat:sj64rt2mz5en3bjud3xs5kqk7q

The Impacts of Write-Through Procedures and Checkpointing on Real-Time Concurrency Control

T.-W. Kuo
2003 Computer journal  
Although RWPCP can guarantee the schedulability of real-time transactions, it could be unrecoverable, and the priority inversion problems could be unbounded, when transaction commitment is considered.  ...  In this paper, we study the impacts of checkpointing and write-through procedures, which are critical in maintaining database recoverability and transaction durability, on the performance of a well-known  ...  We defined the upper and lower period bounds for generation of realtime transactions.  ... 
doi:10.1093/comjnl/46.2.174 fatcat:peammcsfifacfnjceivu2xcpga

Grasping the Gap Between Blocking and Non-Blocking Transactional Memories [chapter]

Petr Kuznetsov, Srivatsan Ravi
2015 Lecture Notes in Computer Science  
Transactional memory (TM) is an inherently optimistic synchronization abstraction: it allows concurrent processes to execute sequences of shared-data accesses (transactions) speculatively, with an option  ...  In this paper, we explain this shift in the TM practice theoretically, via complexity bounds. We prove a few important lower bounds on obstruction-free TMs.  ...  Complexity lower and upper bounds presented in this paper provide such an explanation. Lower bounds for non-blocking TMs.  ... 
doi:10.1007/978-3-662-48653-5_16 fatcat:yzp7oxgcbzewbeqrf54yzgtf2y

Time-based transactional memory with scalable time bases

Torvald Riegel, Christof Fetzer, Pascal Felber
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
Current implementations of time-based transactional memories use a single global clock that is incremented by the commit operation for each update transaction that commits.  ...  We present a scalable replacement for this global counter and describe how the Lazy Snapshot Algorithm (LSA), which forms the basis for our LSA-STM time-based software transactional memory, has to be changed  ...  Acknowledgments We thank Andreas Knüpfer for pointing us to the MMTimer. Robin Holt and Reiner Vogelsang from SGI provided valuable information about MMTimer's synchronization.  ... 
doi:10.1145/1248377.1248415 dblp:conf/spaa/RiegelFF07 fatcat:h5b5fgsvkbaxrcj7i2e6mmycoe

Handling Cases and the Coverage in a Limited Quantity of Memory for Case-Based Planning Systems [chapter]

Flavio Tonidandel, Márcio Rillo
2000 Lecture Notes in Computer Science  
However, in some situations, some cases must be chosen to be deleted, and the method incorporates a case-deletion policy that achieves a lower bound for coverage depletion.  ...  This paper presents a method that refines and abstracts cases in order to release memory space for a new case.  ...  Thus, it is possible to determine, for a desirable lower bound value, the size Mb of a case memory.  ... 
doi:10.1007/3-540-44399-1_4 fatcat:d6vwuelk7nabbbvmkbo4hzyyva

SoC infrastructures for predictable system integration

P van der Wolf, J Geuzebroek
2011 2011 Design, Automation & Test in Europe  
We identify four QoS classes and define the type of QoS guarantees to be supported for the two classes targeted at real-time functions.  ...  Predictable integration of such SoCs, with guaranteed Quality-of-Service (QoS) for the real-time functions, is becoming increasingly challenging.  ...  Note that a LR guarantee specifies a lower bound on the service provided (i.e. the minimum amount of data accepted / supplied by the SoC infrastructure) for any window of arbitrary size within a busy period  ... 
doi:10.1109/date.2011.5763146 dblp:conf/date/WolfG11 fatcat:2tcmufueqjaxhanpuztqebgusq

The Cost of Privatization [chapter]

Hagit Attiya, Eshcar Hillel
2010 Lecture Notes in Computer Science  
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically.  ...  This paper proves an inherent cost for supporting privatization, which is linear in the number of privatized items.  ...  We thank Keren Censor Hillel, Panagiota Fatourou, Petr Kuznetsov, Alessia Milani, and Michael Spear for helpful comments.  ... 
doi:10.1007/978-3-642-15763-9_5 fatcat:t5tmesw3zvcldflablvyehw5oi

Profile-guided proactive garbage collection for locality optimization

Wen-ke Chen, Sanjay Bhansali, Trishul Chilimbi, Xiaofeng Gao, Weihaw Chuang
2006 SIGPLAN notices  
Bounds checking protects pointer and array accesses. It is the process of keeping track of the address boundaries for objects, and checking that the loads and stores do not stray outside bounds.  ...  The goal of our research is to develop hardware support for software checks and for multi-threaded synchronization that protects memory from corruption.  ...  This lowers overhead on two-branch bounds check from 70% to 40% using bnd-array, when measured on an AMD Athlon processor.  ... 
doi:10.1145/1133255.1134021 fatcat:rdddng3bj5fdfprxfg6ut3dg3y

Profile-guided proactive garbage collection for locality optimization

Wen-ke Chen, Sanjay Bhansali, Trishul Chilimbi, Xiaofeng Gao, Weihaw Chuang
2006 Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06  
Bounds checking protects pointer and array accesses. It is the process of keeping track of the address boundaries for objects, and checking that the loads and stores do not stray outside bounds.  ...  The goal of our research is to develop hardware support for software checks and for multi-threaded synchronization that protects memory from corruption.  ...  This lowers overhead on two-branch bounds check from 70% to 40% using bnd-array, when measured on an AMD Athlon processor.  ... 
doi:10.1145/1133981.1134021 dblp:conf/pldi/ChenBCGC06 fatcat:bnv6i26dnfaj3fel6vudd2ut3u

A new method for similarity indexing of market basket data

Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
1999 SIGMOD record  
This paper discusses a method for indexing market basket data efficiently for similarity search.  ...  The resulting similarity search algorithm shows excellent scalability with increasing memory availability and database size.  ...  Note that D,t is a lower bound, whereas Mop* is an upper bound.  ... 
doi:10.1145/304181.304218 fatcat:wnejhi5m7ng75n2aarmi7b2zmu
« Previous Showing results 1 — 15 out of 74,813 results