Sciweavers

580 search results - page 78 / 116
» Performance evaluation of petri nets execution algorithms
Sort
View
PEWASUN
2007
ACM
13 years 11 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
14 years 2 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
ICDCS
2010
IEEE
13 years 11 months ago
Efficient Workstealing for Multicore Event-Driven Systems
Many high-performance communicating systems are designed using the event-driven paradigm. As multicore platforms are now pervasive, it becomes crucial for such systems to take adva...
Fabien Gaud, Sylvain Geneves, Renaud Lachaize, Bap...
DOCENG
2009
ACM
14 years 4 months ago
Test collection management and labeling system
In order to evaluate the performance of information retrieval and extraction algorithms, we need test collections. A test collection consists of a set of documents, a clearly form...
Eunyee Koh, Andruid Kerne, Sarah Berry
IPPS
2008
IEEE
14 years 4 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert