<?xml version="1.0" encoding="ISO-8859-1"?>
<?xml-stylesheet href="/css/rss20.xsl" type="text/xsl"?>
<rss version="2.0" xmlns:pheedo="http://www.pheedo.com/namespace/pheedo">
	<channel>
		<title>IEEE Computer Architecture Letters</title>
		<link>http://www.computer.org/cal</link>
		<description></description>
		<language>en-us</language>
		<pubDate>Thu, 11 Mar 2010 11:00:01 GMT</pubDate>
		<image>
			<url>http://csdl.computer.org/common/images/logos/cal.gif</url>
			<title>IEEE Computer Society</title>
			<description>List of recently published journal articles</description>
			<link>http://www.computer.org/cal</link>
		</image>
		<item>
			<title>PrePrint: Exploiting Internal Parallelism of Flash-based SSDs</title>
			<link>http://www.pheedcontent.com/click.phdo?i=e14e642f662903ad4db85c78a441a709</link>
			<pheedo:origLink>http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.3</pheedo:origLink>
			<description>For the last few years, the major driving force behind the rapid performance improvement of SSDs has been the increment of parallel bus channels between a flash controller and flash memory packages inside the solid-state drives (SSDs). However, there are other internal parallelisms inside SSDs yet to be explored. In order to improve performance further by utilizing the parallelism, this paper suggests request rescheduling and dynamic write request mapping. Simulation results with real workloads have shown that the suggested schemes improve the performance of the SSDs by up to 15% without any additional hardware support.&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=e14e642f662903ad4db85c78a441a709&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; style=&quot;border: 0;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=e14e642f662903ad4db85c78a441a709&amp;p=1&quot;/&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; style=&quot;display:none&quot; src=&quot;http://a.rfihub.com/eus.gif?eui=2225&quot;/&gt;</description>
			<guid isPermaLink="false">http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.3</guid>
		</item>
		<item>
			<title>PrePrint: A Phase Change Memory as a Secure Main Memory</title>
			<link>http://www.pheedcontent.com/click.phdo?i=3e883ef88ba1566ed94e1c821b09d532</link>
			<pheedo:origLink>http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.2</pheedo:origLink>
			<description>Phase change memory (PCM) technology appears as more scalable than DRAM technology. As PCM exhibits access time slightly longer but in the same range as DRAMs, several recent studies have proposed to use PCMs for designing main memory systems. Unfortunately PCM technology suffers from a limited write endurance; typically each memory cell can be only be written a large but still limited number of times ($10^7$ to $10^9$ writes are reported for current technology). Till now, research proposals have essentially focused their attention on designing memory systems that will survive to the average behavior of conventional applications.However PCM memory systems should be designed to survive worst-case applications, i.e., malicious attacks targeting the physical destruction of the memory through overwriting a limited number of memory cells. In this paper, we propose the design of a secure PCM-based main memory that would by construction survive to overwrite attacks.&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=3e883ef88ba1566ed94e1c821b09d532&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; style=&quot;border: 0;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=3e883ef88ba1566ed94e1c821b09d532&amp;p=1&quot;/&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; style=&quot;display:none&quot; src=&quot;http://a.rfihub.com/eus.gif?eui=2225&quot;/&gt;</description>
			<guid isPermaLink="false">http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.2</guid>
		</item>
		<item>
			<title>PrePrint: Using Resampling Techniques to Compute Confidence Intervals for the Harmonic Mean of Rate-Based Performance Metrics</title>
			<link>http://www.pheedcontent.com/click.phdo?i=248b01f807684b941c2656291f27bfa8</link>
			<pheedo:origLink>http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.1</pheedo:origLink>
			<description>Rate-based metrics such as floating point operations per second, instructions per cycle and so forth are commonly used to measure computer performance. In addition to the average or mean performance of the metric, indicating the precision of the mean using confidence intervals helps to make informed decisions and comparisons with the data. In this paper, we discuss the determination of confidence intervals for the harmonic mean of rate-based metrics using two statistical resampling techniques - Jackknife and Bootstrap. We show using Monte Carlo simulations that resampling indeed works as expected, and can be used for generating confidence intervals for harmonic mean.&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;br clear=&quot;both&quot; style=&quot;clear: both;&quot;/&gt;
&lt;a href=&quot;http://ads.pheedo.com/click.phdo?s=248b01f807684b941c2656291f27bfa8&amp;p=1&quot;&gt;&lt;img alt=&quot;&quot; style=&quot;border: 0;&quot; border=&quot;0&quot; src=&quot;http://ads.pheedo.com/img.phdo?s=248b01f807684b941c2656291f27bfa8&amp;p=1&quot;/&gt;&lt;/a&gt;
&lt;img alt=&quot;&quot; height=&quot;0&quot; width=&quot;0&quot; border=&quot;0&quot; style=&quot;display:none&quot; src=&quot;http://a.rfihub.com/eus.gif?eui=2225&quot;/&gt;</description>
			<guid isPermaLink="false">http://doi.ieeecomputersociety.org/10.1109/L-CA.2010.1</guid>
		</item>
		<item>
			<title>IEEE Computer Architecture Letters - July-December 2009 (Vol. 8, No. 2)</title>
			<link>http://www.computer.org/portal/site/cal/</link>
			<description>IEEE Computer Architecture Letters</description>
			<guid isPermaLink="true">http://www.computer.org/portal/site/cal/</guid>
		</item>
	</channel>
</rss>